ACM_大数
小白菜小青菜
平凡的脚步也可以走出伟大的行程!
展开
-
Fibonacci
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<=Pi<=1000)。 Output 输出为N行,每行为对应的f(Pi)。 Sample Input 5 1 2 3 4 5Samp原创 2017-04-11 07:51:50 · 368 阅读 · 0 评论 -
杭电 2100 Children’s Queue
Children’s QueueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14884 Accepted Submission(s): 4940Problem Description There are many studen原创 2017-04-14 11:21:19 · 244 阅读 · 0 评论 -
大数变形版斐波那契
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 - 1) + F(n-2) + F(n-3)原创 2017-04-12 14:10:41 · 471 阅读 · 0 评论