Codeup动态规划的递归写法和递推写法：Fibonacci

问题 A: Fibonacci

时间限制: 1 Sec  内存限制: 32 MB
提交: 896  解决: 275
[提交][状态][讨论版][命题人:外部导入]

题目描述

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<bits/stdc++.h>
using namespace std;
int fibonacci(int n){
	if(n==0) return 0;
	if(n==1) return 1;
	return fibonacci(n-1)+fibonacci(n-2);
}
int main(){
	int n;
	while(~scanf("%d",&n)){
		printf("%d\n",fibonacci(n));
	}
	return 0;
}