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

#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
<<endl;
}
return 0;
}