递推

1、UVa 580 Critical Mass（危险的组合）

参考：《算法竞赛入门经典》P192

注意：n <= 30，所以不会爆 int

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cctype>
#include <ctime>
#include <cassert>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define eps 1e-9

typedef long long ll;
typedef pair<int, int> Pair;

const int INF = 0x7fffffff;

int n;
int f[40], g[40];

int main() {
#ifdef __AiR_H
    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
#endif // __AiR_H
    memset(f, 0, sizeof(f));
    memset(g, 0, sizeof(g));
    f[0] = 0; f[1] = 0; f[2] = 0; f[3] = 1;
    g[0] = 1; g[1] = 2; g[2] = 4; g[3] = 7;
    for (int i = 4; i <= 30; ++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];
    }
    while (scanf("%d", &n) != EOF && n != 0) {
        printf("%d\n", f[n]);
    }
#ifdef __AiR_H
    printf("Time used = %.2fs\n", (double)clock() / CLOCKS_PER_SEC);
#endif // __AiR_H+
    return 0;
}