Fibonacci Number |
Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB |
Total submit users: 252, Accepted users: 236 |
Problem 10072 : No special judgement |
Problem description |
The Fibonacci Numbers {0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...} are defined by the recurrence: F0 = 0 F1 = 1 Fi = Fi-1 + Fi-2 for all i >= 2 Write a program to calculate the Fibonacci Numbers. |
Input |
The first line of the input file contains a single integer T, the number of test cases. The following T lines, each contains an integer n ( 0 <= n <= 45 ), and you are expected to calculate Fn. |
Output |
Output Fn on a separate line. |
Sample Input |
5 0 3 5 9 20 |
Sample Output |
0 2 5 34 6765 |
Problem Source |
SJTU2004 |
acm hnu 10072 Fibonacci Number
最新推荐文章于 2021-08-13 10:55:53 发布