HDU2041 超级楼梯

Fabonacci数列，递推找出规律:f[i] = f[i-1]+f[i-2]

#include <stdio.h>

int res[50];

int
main(int argc, char **argv) {
int ncase;
int n, i;
res[1] = 1;
res[2] = 2;
for (i = 3; i <= 50; ++ i)
res[i] = res[i - 1] + res[i - 2];
scanf("%d", &ncase);
while (ncase--) {
scanf("%d", &n);
printf("%d\n", res[n - 1]);
}
}