2 3 5 3 3 5 6 0
Rabbit Win! Grass Win!
#include<stdio.h>
#include<string.h>
int sg[1007],vis[1007];
int main()
{
sg[0]=0;
int j;
for(int i=1;i<=100;i++)
{
memset(vis,0,sizeof(vis));
for(j=0;j<i;j++)vis[sg[j]]=1;
for(j=1;;j++)if(!vis[j])break;
sg[i]=j;
printf("%d %d\n",i,j);
}
}
#include<stdio.h>
int main()
{
int n,a,sum;
while(scanf("%d",&n),n)
{
sum=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&a);
sum^=a;
}
if(sum)printf("Rabbit Win!\n");
else printf("Grass Win!\n");
}
}
HDU 1849 Rabbit and Grass 简单SG定理,布布扣,bubuko.com
HDU 1849 Rabbit and Grass 简单SG定理
原文:http://blog.csdn.net/crescent__moon/article/details/19998789