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
尼姆博弈的变形:取到最后一枚石子的输
if 所有堆中石子数量不全为1,则常规,1赢0输
else 所有堆中石子数量全为1,奇数堆为输,偶数堆为赢
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<string>
#include<cstdlib>
#include<cmath>
using namespace std;
int num[1055];
int main()
{
int T;
cin>>T;
while(T--)
{
int n;
cin>>n;
for(int i=0;i<=n-1;i++)
cin>>num[i];
bool flag=0;
int sum;
for(int i=0;i<=n-1;i++)
{
if(i==0)
sum=num[i];
else
sum=sum^num[i];
if(num[i]!=1)
flag=1;
}
if(flag)
{
if(sum==0)
cout<<"Brother"<<endl;
else
cout<<"John"<<endl;
}
else
{
if(n%2==1)
cout<<"Brother"<<endl;
else
cout<<"John"<<endl;
}
}
return 0;
}