580 - Critical Mass

题目的实现很简单，但是思维难度大于编程难度，对于这类题目一定要记得从对立面考虑，同时要推导自己考虑的是否合理，紫书中刚开始给出的一种方案是有遗漏的。具体实现见如下代码：

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
using namespace std;

int N;
int f[31], g[31];

void Init(){
	f[0] = f[1] = f[2] = 0;
	g[0] = 1, g[1] = 2, g[2] = 4;
	for (int i = 3; 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];
	}
}

int main(){
	Init();
	while (cin >> N&&N){
		cout << f[N] << endl;
	}
	return 0;
}