HDU

n 个棋子往0方向走，很容易转换成 n 堆石子从某一堆中随便取，谁先取完谁获胜

Nim博弈详解 见上篇博客

#include<iostream>#include<algorithm>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>#include<cmath>#include<set>#include<queue>#include<stack>#include<map>using namespace std;typedef long long ll;const int maxn = 1e5 + 7, INF = 0x7f7f7f7f, mod = 1e9 + 7;int n;int main() {    while(~scanf("%d", &n) && n) {        int ans = 0;        for(int i = 0; i < n; ++i) {            int x; scanf("%d", &x);            ans ^= x;        }        ans ? puts("Rabbit Win!") : puts("Grass Win!") ;    }    return 0;}