HDU1970 John(经典尼姆博奕)

John

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

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

233 5 111

 

Sample Output

JohnBrother

思路：尼姆博奕，本人另一篇博弈文章

此题同HDU2509

代码：

#include<cstdio>#include<iostream>#include<algorithm>#include<queue>#include<stack>#include<cstring>#include<string>#include<vector>#include<cmath>#include<map>using namespace std;typedef long long ll;#define mod 1000000007#define mem(a,b) memset(a,b,sizeof(a))const int maxn = 1e5+5;const int ff = 0x3f3f3f3f;int n,ans; int a[maxn];int main(){int t;cin>>t;while(t--){scanf("%d",&n);ans = 0;for(int i = 1;i<= n;i++)cin>>a[i];sort(a+1,a+n+1);if(a[n] == 1&&a[1] == 1){if(n%2 == 1)cout<<"Brother"<<endl;elsecout<<"John"<<endl;continue;}for(int i = 1;i<= n;i++)ans^= a[i];if(ans == 0)cout<<"Brother"<<endl;elsecout<<"John"<<endl;}return 0;}