牛客网 斐波那契数列

题目描述

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

输出

1

AC代码

#include <iostream>
using namespace std;
int sum(int n){
    if(n==0){return 0;}
    if(n==1){return 1;}
    return sum(n-1)+sum(n-2);
}
int main(){
    int n=0;
    cin>>n;
    cout<<sum(n)<<endl;
    return 0;
}