Fibonacci

题目描述

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

代码

#include<iostream>
using namespace std;
int main(){
    int i,n,f[32]={0,1};
    cin>>n;
    for(i=2;i<=n;i++){
        f[i]=f[i-1]+f[i-2];
    }
    cout<<f[n]<<endl;
    return 0;
}