John
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2809 Accepted Submission(s): 1563
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.
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
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
题目大意:有n中不同颜色的M&Ms,每种的数量为mi个,John(先)和Brother轮流eat,每次可以eat任意多个(至少一个)相同颜色的M&Ms。最后一个eat完的为输。
资料:http://blog.csdn.net/u014634338/article/details/38068771
#include<stdio.h>
#include <iostream>
using namespace std;
int main()
{
int ans,N,n,m,flag;
cin>>N;
while (N--)
{
flag=0;
ans=0;
cin>>n;
for (int i=0; i<n; i++)
{
cin>>m;
ans^=m;
if(m>1)
{
flag=1; //不全为孤单堆
}
}
if(flag==0)
{
if(n%2==0)
{
cout<<"John"<<endl;
}
else
{
cout<<"Brother"<<endl;
}
}
else
{
if(ans==0)
{
cout<<"Brother"<<endl;
}
else
{
cout<<"John"<<endl;
}
}
}
return 0;
}