Rabbit and Grass HDU - 1849 (Bash+Nim)

Posted 2020-12-05 wtsruvf

就是Bash 和 Nim 博弈的结合  可以直接 res ^= (Li + 1) % Mi

也可以 sg打个表  我打了个表

#include <iostream>
#include <cstdio>
#include <sstream>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#define MOD 2018
#define LL long long
#define ULL unsigned long long
#define Pair pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define _  ios_base::sync_with_stdio(0),cin.tie(0)
//freopen("1.txt", "r", stdin);
using namespace std;
const int maxn = 10010, INF = 0x7fffffff;
int sg[maxn];
int n, u, v;
void mex()
{
    bool vis[maxn];
    mem(sg, 0);
    for(int i=1; i<=u; i++)
    {
        mem(vis, 0);
        for(int j=1; j<=v; j++)
        {
            if(i < j) break;
            vis[sg[i-j]] = 1;
        }
        for(int j=0; ; j++)
            if(!vis[j])
            {
                sg[i] = j;
                break;
            }
    }
}

int main()
{
    int T;
    cin>> T;
    while(T--)
    {
        int res = 0;
        cin>> n;
        for(int i=0; i<n; i++)
        {
            cin>> u >> v;
            mex();
            res ^= sg[u];
        }
        if(res) cout<< "No" <<endl;
        else
            cout<< "Yes" <<endl;


    }


    return 0;
}