UVa 900 - Brick Wall Patterns

　　题目大意：用1*2的砖头建n*2的墙，问有多少种不同的砖头排列方式？与斐波那契序列相似。

 #include <cstdio>
 #define MAXN 60
 #define N 50
 
 unsigned int F[MAXN];
 
 int main()
 {
 #ifdef LOCAL
     freopen("in", "r", stdin);
 #endif
     F[] = ;
     F[] = ;
     for (int i = ; i <= N; i++)
         F[i] = F[i-] + F[i-];
     int n;
     while (scanf("%d", &n) && n)
         printf("%u\n", F[n]);
     return ;
 }