HDU 1849 Rabbit and Grass
只是一道Nim题我们可以把他转化成堆就可以了,这个点在哪个地方就相当于这个地点有好多的石子,这样就可以了。
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib> 4 #include<algorithm> 5 #include<cmath> 6 #include<queue> 7 #include<set> 8 #include<map> 9 #include<vector> 10 using namespace std; 11 12 int main( ) 13 { 14 int n ,m; 15 while( scanf( "%d",&n ),n ) 16 { 17 int t=0; 18 while( n -- ) 19 { 20 scanf( "%d",&m ); 21 t ^= m; 22 } 23 if( t ) puts( "Rabbit Win!" ); 24 else puts( "Grass Win!" ); 25 } 26 //system( "pause" ); 27 return 0; 28 }