#include <iostream>
using namespace std;
int main()
{
int N, M;
int Lu[200];
cin >> N;
while (N--)
{
cin >> M;
if (M == 1)
cout << 0 << endl;
else
{
M = M - 1;
Lu[0] = 1;
Lu[1] = 2;
for (int i = 2; i < M; i++)
Lu[i] = Lu[i - 1] + Lu[i - 2];
cout << Lu[M - 1] << endl;
}
}
return 0;
}
HDU ACM 2041 超级楼梯
最新推荐文章于 2018-09-07 10:04:48 发布