1795 Problem A Fibonacci

问题 A: Fibonacci

时间限制: 1 Sec  内存限制: 32 MB
提交: 230  解决: 72
 

题目描述

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

经验总结

这种题目我就不说话了。。直接上代码0.0

正确代码

#include <cstdio>
const int maxn=60;
int dp[maxn];

int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		dp[0]=0;
		dp[1]=1;
		for(int i=2;i<=n;++i)
		{
			dp[i]=dp[i-1]+dp[i-2];
		}
		printf("%d\n",dp[n]);
	}
    return 0;
}