更新时间:2022-09-15 12:27:48
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 103 Accepted Submission(s): 87
1
3
2
1
3
2
递归公式:a[n] = a[n-1]+a[n-2].
#include <iostream>
using namespace std;
int main()
{
long long a[51];
a[1] = 1; a[2] = 2;
for(int i = 3;i < 51;i++)
{
a[i] = a[i-1]+a[i-2];
}
int n;
while(cin>>n)
cout<<a[n]<<endl;
return 0;
}
本文转自NewPanderKing51CTO博客,原文链接: http://www.cnblogs.com/newpanderking/archive/2011/08/01/2123407.html,如需转载请自行联系原作者