HDU(1849)Rabbit and Grass(博弈)

/*      尼姆博弈，并且SG（n） =  n */#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>#include <math.h>#include <stdlib.h>#include <queue>#include <vector>using namespace std;int main (){    int n,m;    while(scanf("%d",&n)&&n){        int ans = 0;        for(int i = 0;i < n;i++){            scanf("%d",&m);            ans ^= m;        }        if(ans)            printf("Rabbit Win!\n");        else            printf("Grass Win!\n");    }    return 0;}