题目描述
The Fibonacci Numbers{0,1,1,2,3,5,8,13,21,34,55...} are defined by the recurrence: F0=0 F1=1 Fn=Fn-1+Fn-2,n>=2 Write a program to calculate the Fibonacci Numbers.
输入描述
Each case contains a number n and you are expected to calculate Fn.(0<=n<=30) 。
输出描述
For each case, print a number Fn on a separate line,which means the nth Fibonacci Number.
程序代码
#include <iostream>
using namespace std;
int main()
{int n;cin >> n;if(!n) cout << 0 << endl;else{int a[n+1], i; a[0]=0; a[1]=1;for(i=2; i<=n; i++)a[i] = a[i-1]+a[i-2];cout << a[n];} return 0;
}