九度OJ 1092 Fibonacci

题目1092：Fibonacci

时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：1576

解决：1158

题目描述：

    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<stdio.h>
int f[40];
int main(int argc, char *argv[])
{
    f[0]=0;
    f[1]=1;
    for(int i=2;i<=30;++i)
        f[i]=f[i-1]+f[i-2];
    int n;
    while(~scanf("%d",&n))
    {
        printf("%d\n",f[n]);
    }
    return 0;
}
 
/**************************************************************
    Problem: 1092
    User: kirchhoff
    Language: C
    Result: Accepted
    Time:0 ms
    Memory:912 kb
****************************************************************/