题解 | #Fibonacci#
Fibonacci
http://www.nowcoder.com/practice/17ad6908e36a49f4b06ea96936e8bb25
#include<iostream>
using namespace std;
const int N = 50;
int a[N];
int fab(int n)
{
if(n <= 1) return n;
return fab(n - 1) + fab(n - 2);
}
void init()
{
a[0] = 0;
a[1] = 1;
for(int i = 2; i < N; i ++)
{
a[i] = a[i - 1] + a[i - 2];
}
}
int main()
{
init();
int n;
while(cin >> n)
{
cout << a[n] << endl;
}
return 0;
}