您的位置：首页 > 其它

acm hnu 10072 Fibonacci Number

2006-10-25 12:21 267 查看
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

内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 点击这里给我发消息
标签： 
相关文章推荐
新的分享
章节导航