题目大意:用1*2的砖头建n*2的墙,问有多少种不同的砖头排列方式?与斐波那契序列相似。
1 #include <cstdio> 2 #define MAXN 60 3 #define N 50 4 5 unsigned int F[MAXN]; 6 7 int main() 8 { 9 #ifdef LOCAL 10 freopen("in", "r", stdin); 11 #endif 12 F[1] = 1; 13 F[2] = 2; 14 for (int i = 3; i <= N; i++) 15 F[i] = F[i-1] + F[i-2]; 16 int n; 17 while (scanf("%d", &n) && n) 18 printf("%u ", F[n]); 19 return 0; 20 }