HDU 1907 John

 

John

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

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

 

解题：

       尼姆博弈。对于N堆的糖，一种情况下是每堆都是1，那么谁输谁赢看堆数就知道；对于不都是1的话，若这些堆是奇异局势，或说他们是非奇异局势，但非奇异局势皆可以转换到奇异局势（具体转变看上一篇介绍）。

       经典的尼姆问题是谁哪拿到最后一个则谁赢，本题是拿最后一个的输。下面分析第二种情况：
1.初始给的是奇异局势的话，则先取者为输。
2.初始给的是非奇异局势的话，则先取者为赢。辗转转换非奇异、奇异的次数是相对的。

#include <iostream> using namespace std; int main() { int T,N,i,A[50],sum,k; cin>>T; while (T--) { cin>>N; sum=0;k=0; for (i=0;i<N;i++) { cin>>A[i]; sum^=A[i]; if (A[i]>1) { k=1; } } if (k==0) //对于每堆都是1的情况下 { if (N%2==0) { cout<<"John"<<endl; } else { cout<<"Brother"<<endl; } } else { if (sum==0) //对于奇异局势的情况下 { cout<<"Brother"<<endl; } else //对于非奇异局势的情况下 { cout<<"John"<<endl; } } } return 0; }