POJ 3537 Crosses and Crosses

POJ 3537 Crosses and Crosses

我们取一个位置之后，对手在这个点的左边和右边的两点之内都不能选。相当于一次取了五个位置。

所以 sg[i] = mex{ sg[j-3]^sg[i-j-2] | 1<=j<=i}

#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 2100
#define oo 0x7fffffff
#define eps 1e-8

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

int sg[nMax],vis[200];
//int ans=0;
void init(){
    sg[0]=0;
    int k;
    for(int i=1;i<=2000;i++){
        CLR(vis);
        for(int j=1;j<=i;j++){
            k=0;
            if(j>=3) k^=sg[j-3];
            if(i-j-2>=0) k^=sg[i-j-2];
            vis[k]=1;
            //ans = max(ans,k);
        }
        for(int j=0;;j++)if(!vis[j]) {sg[i]=j;break;}
    }
    //printf("%d\n",ans);
}

int main(){
#ifndef ONLINE_JUDGE
//    freopen("input.txt","r",stdin);
#endif
    init();
    //FOR(i,1,20) printf("%d ",sg[i]);printf("\n");
    int n;
    while(~scanf("%d",&n)){
        printf("%d\n",sg[n]?1:2);
    }
    return 0;
}