PAT练习 Fibonacci

Description

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.

Input

Each case contains a number n and you are expected to calculate Fn.(0<=n<=30) 。

Output

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

Sample Input

1

Sample Output

1

C++实现

DP法

//
//  main.cpp
//  AN11.1-A
//
//  Created by Vikill Blacks on 2021/3/30.
//

#include <iostream>
using  namespace std;
const int maxn = 10010;
int dp[maxn];


int F(int n) {
    if(n == 0 || n == 1) return n;
    if(dp[n]) return dp[n];
    else {
        dp[n] = F(n - 1) + F(n - 2);
        return dp[n];
    }
}

int main(int argc, const char * argv[]) {
    dp[0] = 0;
    dp[1] = 1;
    int n;
    while(scanf("%d", &n) != EOF) {
        printf("%d\n", F(n));
    }
    return 0;
}