poj1907 nim博弈

Problem Description
Little John is playing very funny game with his younger brother. There is one big box filled with M&Ms of different colors. At first John has to eat several M&Ms of the same color. Then his opponent has to make a turn. And so on. Please note that each player has to eat at least one M&M during his turn. If John (or his brother) will eat the last M&M from the box he will be considered as a looser and he will have to buy a new candy box.

Both of players are using optimal game strategy. John starts first always. You will be given information about M&Ms and your task is to determine a winner of such a beautiful game.

 

Input
The first line of input will contain a single integer T – the number of test cases. Next T pairs of lines will describe tests in a following format. The first line of each test will contain an integer N – the amount of different M&M colors in a box. Next line will contain N integers Ai, separated by spaces – amount of M&Ms of i-th color.

Constraints:
1 <= T <= 474,
1 <= N <= 47,
1 <= Ai <= 4747

 

Output
Output T lines each of them containing information about game winner. Print “John” if John will win the game or “Brother” in other case.

 

Sample Input
  
  
2 3 3 5 1 1 1

 




nim博弈

对于取光者胜利的规则下  异或=0则先手必胜。

对于取光者失败的规则下 异或=0则先手不一定必败。 如果所有的堆都为1的话,那么就看堆的奇偶数了。

#include<cstdio>
 #include<cstring>
 #include<queue>
 #include<iostream>
 #include<cmath>
 using namespace std;
 int n,a;
 int main()
 {
     int t,u;
     cin>>t;
     while(t--)
     {
         cin>>n;
         u=n;
         int sum=0;
         int flag=0;
         while(n--)
         {
             cin>>a;
             sum^=a;
             if(a>1)
             {
                 flag=1;
             }
         }
         if(flag)
         {
             if(sum==0)
             {
                 cout<<"Brother"<<endl;
             }
             else
             {
                 cout<<"John"<<endl;
             }
         }
         else
         {
             if(u%2)
             {
                 cout<<"Brother"<<endl;
             }
             else
             {
                  cout<<"John"<<endl;
             }
         }
     }
 }


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值