- 博客(7)
- 收藏
- 关注
RSS订阅原创 Hat's Fibonacci
Problem Description A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1. F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n -
2014-02-18 15:24:57
462
原创 Equipment Box
Problem Description There is a large room in the Pyramid called Room-of-No-Return. Its floor is covered by rectangular tiles of equal size. The name of the room was chosen because of the very high nu
2014-02-18 15:13:44
896
原创 I think I need a houseboat
Problem Description Fred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned that the state of Louisiana is actuall
2014-02-18 15:06:55
376
转载 Biorhythms
Description Some people believe that there are three cycles in a person's life that start the day he or she is born. These three cycles are the physical, emotional, and intellectual cycles, and they
2014-02-18 14:57:31
608
原创 求N!
Problem Description Given an integer N(0 ≤ N ≤ 10000), your task is to calculate N! Input One N in one line, process to the end of file. Output For each N, output N! in one line. #
2014-02-18 14:53:29
399
转载 大菲波数
Problem Description Fibonacci数列，定义如下： f(1)=f(2)=1 f(n)=f(n-1)+f(n-2) n>=3。 计算第n项Fibonacci数值。 Input 输入第一行为一个整数N，接下来N行为整数Pi（1 Output 输出为N行，每行为对应的f(Pi)。 思路： f(n) = 1*f(n-1) +1*
2014-02-18 14:45:29
512
原创 A+B Problem II
Problem Description I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. Input The first line of the input contains an integer T(1<=T<=20)
2014-02-18 14:30:11
490
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人