POJ2068 Nim

POJ2068 Nim

简单的博弈dp，记忆话搜索可能好些一点。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<set>
#include<queue>
#include<map>

using namespace std;

#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define DOR(i,a,b) for(int (i)=(a);(i)>=(b);(i)--)
#define CLR(a) memset((a),0,sizeof((a)))
#define pb push_back
#define mp make_pair
#define ins insert
#define F first
#define S second
#define bug puts("Oh Here!");

#define nMax 210
#define oo 0x7fffffff
#define eps 1e-8

#define LL long long
#define Vec vector<int>
#define Pai pair<int,int>

int dp[23][1<<14];
int M[23],n;
int dfs(int u,int S){
    if(dp[u][S]!=-1) return dp[u][S];
    if(S==1) return dp[u][S]=0;
    int v=u+1;
    if(v>2*n) v=1;
    for(int i=1;i<=M[u];i++)if(S-i>=1) {

        if(dfs(v,S-i)==0) return dp[u][S]=1;
    }
    return dp[u][S]=0;
}
int main(){
#ifndef ONLINE_JUDGE
//    freopen("input.txt","r",stdin);
#endif
    int S;
    while(~scanf("%d",&n),n){
        scanf("%d",&S);
        FOR(i,1,2*n)scanf("%d",&M[i]);
        memset(dp,-1,sizeof(dp));
        if(dfs(1,S)) printf("1\n");
        else printf("0\n");
    }
    return 0;
}