http://ac.jobdu.com/problem.php?cid=1040&pid=92
基础动态规划题
思考最后一步,要么上一阶,要么上两阶,所以f(n)=f(n-1)+f(n-2)
#include <stdio.h>
long long a[90];
int main()
{
int n,i;
while (scanf("%d",&n)!=EOF)
{
a[1]=1;
a[2]=2;
for (i=3;i<=n;i++)
{
a[i]=a[i-1]+a[i-2];
}
printf("%lld\n",a[n]);
}
return 0;
}