杰拉斯的博客
[ACM_ZJUT_1382]计算N!（数组模拟超大数运算）
杰拉斯 | 时间：2012-04-11, Wed | 12,176 views编程算法
计算N!
Time Limit:1000MS Memory Limit:32768K
Description
yaojian最近学了一个新的运算法则——阶乘，但他很懒，不想一步一步计算，所以他想让你来帮他编一个程序，能马上得到N的阶乘。
Input
输入包含若干行数据，每行都有一个整数N(0<=N<=200)。
Output
与输入相对应每行输出N的阶乘。
[ACM_HDU_1297]Children’s Queue
杰拉斯 | 时间：2012-04-01, Sun | 21,920 views编程算法
Children’s Queue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5660 Accepted Submission(s): 1755
Description
There are many students in PHT School. One day, the headmaster whose name is PigHeader wanted all students stand in a line. He prescribed that girl can not be in single. In other words, either no girl in the queue or more than one girl stands side by side. The case n=4 (n is the number of children) is like
FFFF, FFFM, MFFF, FFMM, MFFM, MMFF, MMMM
Here F stands for a girl and M stands for a boy. The total number of queue satisfied the headmaster’s needs is 7. Can you make a program to find the total number of queue with n children?
Input
There are multiple cases in this problem and ended by the EOF. In each case, there is only one integer n means the number of children (1<=n<=1000)
Output
For each test case, there is only one integer means the number of queue satisfied the headmaster’s needs.