hdu1849 1850 1851 nim博弈 

 1 #include<stdio.h>
 2 int main()
 3 {
 4     int n,k,a,i;
 5     while (~scanf("%d",&n)&&n!=0)
 6     {
 7         k=0;
 8         for (i=1;i<=n;i++)
 9         {
10             scanf("%d",&a);
11             k=k^a;
12         }
13         if (k!=0) printf("Rabbit Win!\n");
14         else printf("Grass Win!\n");
15     }
16
 1 #include<stdio.h>
 2 int main()
 3 {
 4     int sum,k,n,i,a[10005];
 5     while (~scanf("%d",&n)&&n!=0)
 6     {
 7         k=0;
 8         for (i=1;i<=n;i++)
 9         {
10             scanf("%d",&a[i]);
11             k=k^a[i];
12         }
13         sum=0;
14         for (i=1;i<=n;i++)
15          if ((k^a[i])<a[i]) sum++;//ÀšºÅÒªŒÓ£¬Ð¡ÓÚ 
16         if (k==0) printf("0\n");
17         else printf("%d\n",sum);
18     }
19 } 
 1 #include<stdio.h>
 2 int main()
 3 {
 4     int t,n,k,i,a,b;
 5     while (~scanf("%d",&t))
 6     while (t--)
 7     {
 8         scanf("%d",&n);
 9         k=0;
10         for (i=1;i<=n;i++)
11         {
12             scanf("%d%d",&a,&b);
13             k=k^(a%(b+1));
14         }
15         if (k==0) printf("Yes\n");
16         else printf("No\n");
17     }
18 }

 

posted on 2014-07-16 16:32  xiao_xin  阅读(95)  评论(0)    收藏  举报

导航