HDU1849 Rabbit and Grass (Nim finishing)

This kind of problem is that there are n heaps of things, each time you can take any heap of any

The last to be taken out of the winning

is to read the n heap in all the different or, not equal to 0 win

/************************************************author:d evilcreated time:2016/5/29 11:19:41***************** ******************************* */#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<vector>#include<queue>#include<Set>#include<assert.h>#include<map>#include<string>#include<cmath>#include<stdlib.h>using namespacestd;intMain () {//freopen ("In.txt", "R", stdin);    intN;  while(~SCANF ("%d", &n) &&N) {intx,ans=0;  while(n--) {scanf ("%d",&x); Ans^=x; }        if(ANS) printf ("Rabbit win!\n"); Elseprintf"Grass win!\n"); }    return 0;}

HDU1849 Rabbit and Grass (Nim finishing)