题目1092：Fibonacci

转运四方海淘网 : zysfht.com

题目描述：

    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

来源：

2006年上海交通大学计算机研究生机试真题

#include<stdio.h> int fib(int n){    if(n==1||n==2)            return 1;    else            return fib(n-1)+fib(n-2);}int main(){    int n=0,i=1,j=1,m=0;    while(scanf("%d",&n)!=EOF)    {        printf("%d\n",fib(n));    }    return 0;}/**************************************************************    Problem: 1092    Language: C    Result: Accepted    Time:20 ms    Memory:912 kb****************************************************************/