Critical Mass UVA - 580

题意：有一些装有铀（用U表示）和铅（用L表示）的盒子，数量均足够多。要求把(n <= 30)个盒子放成一行，但至少有三个U放在一起，有多少种方法

思路：紫书P331

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
#define mod 1000000007;
using namespace std;
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
const int maxn = 30 + 2;
int n,f[maxn],g[maxn];
void init()
{
    f[0] = f[1] = f[2] = 0;
    g[0] = 1,g[1] = 2,g[2] = 4;
    for(int i = 3;i < maxn;i++)
    {
        f[i] = 1 << (i - 3);
        for(int j = 2;j <= i - 2;j++)
            f[i] += g[j - 2] * (1 << (i - j - 2));
        g[i] = (1 << i) - f[i];
    }
}
int main()
{
    init();
    while(scanf("%d",&n) && n)
    {
        printf("%d\n",f[n]);
    }
    return 0;
}