HDU 2040 超级楼梯

..

 

 

.

 

 1 #include<iostream>
 2 
 3 using namespace std;
 4 int main()
 5 {
 6     int a[66];
 7     a[1]=1;
 8     a[2]=1;
 9     
10     int i;
11     for(i=3;i<60;i++)
12     {
13         a[i]=a[i-1]+a[i-2];
14     }
15     int m;
16 //    cin>>m;
17     int n,x;
18     cin>>x;
19     while(x--)
20     {
21         cin>>n;
22         cout<<a[n]<<endl;
23     }
24     return 0;
25 }

 和斐波那契数列异曲同工~

转载于:https://www.cnblogs.com/greenaway07/p/10554182.html