返回题解分享
讨论 / 题解分享/ 帖子详情

爬楼梯 - 题解

#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int>su(n+1);
for (int i = 1; i <= n; i++)cin >> su[i];
int way[1001];
way[1] = 0;
way[2] = 1;
way[3] = 2;
for (int i = 1; i <= n; i++)
{
for (int j = 4; j <= su[i]; j++)
way[j] = way[j - 1] + way[j - 2];
cout << way[su[i]] << endl;
}

return 0;


}
0 回复 0 转发 0 喜欢 1 阅读
回复 (0)
默认 最新
暂无回复,快来抢沙发!