问题 A: Fibonacci
时间限制: 1 Sec 内存限制: 32 MB
献花: 109 解决: 42
[献花][花圈][TK题库]
题目描述
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.
样例输入
1
样例输出
1
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
using namespace std;
const int MaxN = 33;
int main()
{
#ifdef _DEBUG
freopen("data.txt", "r+", stdin);
#endif // _DEBUG
std::ios::sync_with_stdio(false);
int Fibo[MaxN]; Fibo[0] = 0; Fibo[1] = 1;
for (int i = 2; i < MaxN ; ++i)
Fibo[i] = Fibo[i - 2] + Fibo[i - 1];
int n;
while (cin >> n)
cout << Fibo[n] << endl;
return 0;
}
/**************************************************************
Problem: 1795
User: Sharwen
Language: C++
Result: 升仙
Time:1 ms
Memory:1696 kb
****************************************************************/