Welcome   HUNAN NORMAL UNIVERSITY ACM/ICPC Judge Online
Home
FAQs
Problem Set
Practices
Online Contests
Major Exercises
OI Special
Judgement
Submit
Online Status
User Ranklist
Users
Register new
Login
Web Links
Hunan Normal University
College of Information Science and Engineering
肥波与阿Q故事
Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB
Total submit users: 91, Accepted users: 88
Problem 10827 : No special judgement
Problem description
  一天,肥波去帮姑姑打酱油,肥波到了粮店找到了老板阿Q,肥波想,帮姑姑多买点吧,以后我就不用再跑了,而且天天有酱油喝。肥波准备把粮店的酱油都买下来。阿Q的酱油柜非常有特色,最上层的格子只能方1瓶酱油,第二层能放2!瓶酱油,依次类推,第n层放n!瓶酱油(n<=10)。肥波总共要买多少瓶酱油呢?

Input
  有多组测试数据,输入柜子层数n.输入C++用while(cin>>n),C用while(scanf("%d",&n)!=EOF).

Output
  每组数据一行,输出酱油数.

Sample Input
3
Sample Output
9
Problem Source
  chengxinyi

Submit   Discuss   Judge Status  Problems  Ranklist 

HUNAN NORMAL UNIVERSITY ACM/ICPC Judge Online, Version 2010.5.5.final.
Web visits:19632 today,16242623 total, since 2010-05-07