HDU 1849 Rabbit and Grass

题解:因为棋子可重叠,所以就等于取石子问题,即尼姆博弈,SG[i]=i,直接将输入数据异或即可。

#include <cstdio>
int main(){
    int SG,n,a;
    while(scanf("%d",&n),n){
        SG=0;
        while(n--){
            scanf("%d",&a);
            SG=SG^a;
        }    
        if(SG==0)printf("Grass Win!
");
        else printf("Rabbit Win!
");
    }    
    return 0;
}    
原文地址:https://www.cnblogs.com/forever97/p/3676370.html