acm hnu 10072 Fibonacci Number

最新推荐文章于 2019-03-15 13:17:23 发布

原创最新推荐文章于 2019-03-15 13:17:23 发布 · 1.6k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#integer #output #input #numbers #each #file

Algorithm 专栏收录该内容

33 篇文章

订阅专栏

本文介绍了一个简单的程序设计问题——计算斐波那契数列。通过递归定义的方式给出了斐波那契数列的定义，并提供了一个计算指定项数值的程序实现方案。输入为一个整数n，输出为斐波那契数列第n项的值。

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