算法笔记-问题 A: Fibonacci

问题 A: 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.

样例输入 Copy

1

样例输出 Copy

1

代码：

#include<bits/stdc++.h>

using namespace std;

const int maxn = 31;

int d[maxn];

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

int main(){
    fill(d, d+maxn, -1);
    int n;
    while(scanf("%d", &n)!=EOF){
        printf("%d\n", F(n-1));
    }
    return 0;
}