ACMSTEP 3.1.1 超级楼梯 //递推 斐波那契数列

原题链接

端详了好久 用递归做了一下 LTE了 觉得像斐波那契数列 居然AC了。。囧

#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <cstdlib>#include <cctype>#include <string>#include <vector>#include <queue>#include <algorithm>long long a[41];void make(){int i;a[1]=1;a[2]=1;for (i=3; i<=40; i++){a[i] = a[i-1] + a[i-2];}}using namespace std;int main(){int cases, n;make();cin>>cases;while (cases--){cin>>n;cout<<a[n]<<endl;}return 0;}