Codeup100000625问题 A: Fibonacci

题目描述：

The Fibonacci Numbers{0,1,1,2,3,5,8,13,21,34,55…} are defined by the recurrence:
$F_0=0；F_1=1；F_n=F_{n-1}+F_{n-2},n\ge 2$
Write a program to calculate the Fibonacci Numbers.

输入：

Each case contains a number n and you are expected to calculate Fn.($0\le n\le 30$) 。

输出：

For each case, print a number Fn on a separate line,which means the nth Fibonacci Number.

样例输入：

1

样例输出：

1

实现代码1：

#include<cstdio>

const int maxn = 35;
int f[maxn];

void Fibonacci() {
    f[0] = 0;
    f[1]=1;
    for(int i = 2; i < maxn; i++) {
        f[i] = f[i - 1] + f[i - 2];
    }
}

int main() {
    int n;
    Fibonacci();
    while(scanf("%d", &n) != EOF) {
        printf("%d\n", f[n]);
    }
    return 0;
}

实现代码2：

#include<cstdio>

int Fibonacci(int n){
    if(n==0){
        return 0;
    }
    if(n==1){
        return 1;
    }
    return Fibonacci(n-1)+Fibonacci(n-2);
}

int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        printf("%d\n",Fibonacci(n));
    }
    return 0;
}