HDU 1907解题报告

John

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 3204    Accepted Submission(s): 1800

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
  
  

 

Sample Output

  
  

   
   John
Brother
  
  

 

Source

Southeastern Europe 2007

 

Recommend

lcy   |   We have carefully selected several similar problems for you:   1913  1908  1914  1915  1909 

        这道题是简单的Nim博弈的变种。需要判断全为1的情形。因此只需要判断特殊情况即可。

        参考代码：

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<ctime>
#include<cstdlib>
#include<iomanip>
#include<utility>
#define pb push_back
#define mp make_pair
#define CLR(x) memset(x,0,sizeof(x))
#define _CLR(x) memset(x,-1,sizeof(x))
#define REP(i,n) for(int i=0;i<n;i++)
#define Debug(x) cout<<#x<<"="<<x<<" "<<endl
#define REP(i,l,r) for(int i=l;i<=r;i++)
#define rep(i,l,r) for(int i=l;i<r;i++)
#define RREP(i,l,r) for(int i=l;i>=r;i--)
#define rrep(i,l,r) for(int i=1;i>r;i--)
#define read(x) scanf("%d",&x)
#define put(x) printf("%d\n",x)
#define ll long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<11
using namespace std;

int t,n;
int main()
{
   read(t);
   while(t--)
   {
       read(n);
       int ans=0,cnt=0;
       rep(i,0,n)
       {
           int num;
           read(num);
           if(num>1) cnt++;
           ans^=num;
       }
       if(!ans&&cnt!=0) printf("Brother\n");   //异或之和为0，并且个数大于1的个数不为0，即除去全部为偶数个1的情形
       else
       {
           if(ans==1)
           {
               if(!cnt) //所有数都为1，进行特殊判断
               {
                   if(n%2==1)
                      printf("Brother\n");
                   else
                      printf("John\n");
               }
               else
                  printf("John\n");
           }
           else
               printf("John\n");
       }
   }
}