poj 2068（博弈-状态转移）

如果某个状态能到达的状态都是必胜态，那么此状态为必败态
如果某个状态能到达的状态存在必败态，那么此状态为必胜态

#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define l(x) ((x)<<1)
#define r(x) ((x)<<1|1)
#define lowbit(x) ((x)&(-(x)))
#define abs(x) ((x)>=0?(x):(-(x)))
#define ms(a,b) memset(a,b,sizeof(a))
#define NSYNC std::ios::sync_with_stdio(false);std::cin.tie(0);std::cout.tie(0);

using namespace std;

int n, s, m[22],dp[22][1<<14];

int get(int i, int j) {
	if (j == 0) return dp[i][j] = 1;
	if (dp[i][j] != -1) return dp[i][j];

	for (int k = 1; k <= m[i]; k++) {
		if (j - k < 0)break;
		if (get((i + 1) % (n * 2), j - k) == 0)return dp[i][j] = 1;
	}
	return dp[i][j] = 0;
}

int main(){
	while (scanf("%d", &n), n) {
		scanf("%d", &s);
		for (int i = 0; i < n * 2; i++) {
			scanf("%d", &m[i]);
		}
		ms(dp, -1);
		printf("%d\n", get(0, s));
	}

	return 0;
}