问题1348--Fibonacci

1348: Fibonacci

时间限制: 1 Sec  内存限制: 128 MB
提交: 475  解决: 229
[状态] [讨论版] [提交] [命题人:]
题目描述

There are another kind of Fibonacci numbers: F(0) = 0, F(1) = 1, F(n) = F(n-1) + F(n-2) (n>=2).

输入

Input consists of a sequence of lines, each containing an integer n. (0 <= n < = 40).

输出

Print F(n).

样例输入 Copy
2
5
样例输出 Copy
1
5
来源/分类