Marbles Gym - 101908B

https://cn.vjudge.net/problem/Gym-101908B

思路：全部都到了不是（0，x）（x，0）（x，x）， 那么下一个就必输了；nim博弈是异或为不为0就是还可以走，那么当前点和它能到达点是不能相同数量（取石头）的，不然异或起来就是0了，就是不能走了，而实际是可以到它能到的其他点的，所以不能和它们相同；

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <tr1/unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

const int maxn=5e6+9;
const int mod=1e9+7;

int sg[109][109];
bool vis[100*100+10];

int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);

    for(int i=1;i<=100;i++)
    {
        for(int j=1;j<=100;j++)
        {
            if(i==j) continue;
            mem(vis,0);
            for(int k=1;k<i;k++) if(k!=j) vis[sg[k][j]]=1;
            for(int k=1;k<j;k++) if(k!=i) vis[sg[i][k]]=1;
            for(int k=1;k<min(i,j);k++) vis[sg[i-k][j-k]]=1;
            int id=0;
            while(vis[id]) id++;
            sg[i][j]=id;
        }

    }

    int n;
    cin>>n;
    int sum=0;
    bool f=0;
    while(n--)
    {
        int x,y;
        cin>>x>>y;
        if(x==y||x==0||y==0) f=1;
        sum^=sg[x][y];
    }
    if(f||sum!=0) puts("Y");
    else puts("N");


    return 0;
}