HDU 2509 反尼姆博弈

这可以说是昨晚刷夜最大的收获了吧，把NIM和反NIM基本搞清了，SG函数什么的还是无解。

反NIM博弈模板题。

//HDU2509.cpp
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <climits>
#include <cctype>
#include <algorithm>
#include <iostream>
#include <string>
#include <stack>
#include <map>
#include <set>
#include <queue>
#include <utility>
#include <vector>
#include <bitset>
#include <functional>
using namespace std;
//const double pai = acos(-1.0);
const double pai = 3.14159265358979323846;
const int INF = 0x3f3f3f3f;
typedef long long love_live;

int main(int argc, char const *argv[]) {
#ifndef ONLINE_JUDGE
//    freopen("output", "w", stdout);
    freopen("input", "r", stdin);
#endif
    int n, m, i, j, k;
    while(scanf("%d", &n) != EOF){
        int rich = 0;
        int along = 0;
        int sum = 0;
        for(i = 0; i < n; ++i){
            scanf("%d", &k);
            sum ^= k;
            if(k > 1){
                rich++;
            }
            else if(k == 1){
                along++;
            }
        }
        if(sum == 0){
            if(rich >= 2){
                printf("No\n");
            }
            else{
                printf("Yes\n");
            }
        }
        else if(sum > 0){
            if(rich == 0){
                printf("No\n");
            }
            else{
                printf("Yes\n");
            }
        }
    }
return 0;
}