By yusijia

Updated:

Contents

//超级楼梯，每次只能上一级或两级楼梯，一开始站在第一级楼梯上

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <cstdio>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
using namespace std;

int main()
{
    int n, m, i, sum, a[41] = {0};
    a[1] = 1;
    a[2] = 1;
    for(int i = 3; i <= 40; i++)
        a[i] = a[i - 1] + a[i - 2];//状态转移方程
    scanf("%d", &n);
    while(n--){
        scanf("%d", &m);
        printf("%d\n", a[m]);
    }
    return 0;
}
Contents