有一楼梯共M级,刚开始时你在第一级,若每次只能跨上一级或二级,要走上第M级,共有多少种走法?
Input
输入数据首先包含一个整数N,表示测试实例的个数,然后是N行数据,每行包含一个整数M(1<=M<=40),表示楼梯的级数。
Output
对于每个测试实例,请输出不同走法的数量
Sample Input
2
2
3
Sample Output
1
2
#include<stdio.h>
int sel(int a, int b);
int main(){
int i, t, a, num;
int ans = 0;
int n;
scanf("%d", &n);
while(n > 0){
scanf("%d", &num);
num -= 1;
t = num / 2;
//printf("num = %d ", num);
//printf("t = %d\n", t);
for(i = 1; i <= t; i++){
//printf("i = %d num-i = %d ", i, num - i);
//printf("sel = %d", sel(num - i, i));
ans += sel(num - i, i);
//printf("ans = %d\n", ans);
}
printf("%d\n", ans + 1);
//scanf("%d %d", &a, &b);
//c = sel(a, b);
//printf("%d\n", c);
n--;
}
return 0;
}
int sel(int a, int b){
int ans = 1;
int t;
int na = 1, nb = 1;
t = b;
while(t >= 1){
//printf("na = %d a = %d ", na, a);
na *= a;
//printf(" %d\n", na);
a--;
t--;
}
//printf("\n");
while(b >= 1){
//printf("nb = %d b = %d", nb, b);
nb *= b;
//printf(" %d\n", na);
b--;
}
//printf("\n");
ans = na / nb;
return ans;
}