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 个,两个人轮流取石子,任选一堆至少取一个石子。取完后石子没有了则那个人输。
思路:
Nimm 博弈~设一堆中仅有1个石子则称为孤单态s1,大于等于2个石子则为充裕态s2,所有石子总数异或的结果为ans。
先者必输:ans=0 , s2=0;ans !=0,s2!=0
后者必输:ans=0,s2>=0;ans!=0,s1%2!=0,s2=0
CODE:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
const int inf=0xfffffff;
typedef long long ll;
using namespace std;
int main()
{
int T;
scanf("%d", &T);
while(T--){
int n;
scanf("%d", &n);
int a, s1=0, s2=0, ans=0;
for(int i=0; i<n; i++){
scanf("%d", &a);
if(a >= 2) s2 ++;
else s1 ++;
ans ^= a;
}
if((s2 == 0 & (s1%2 != 0) && ans != 0) || (ans == 0 && s2 >= 2)) printf("Brother\n");
else if((ans == 0 && s2 == 0) || (ans != 0 && s2 != 0)) printf("John\n");
}
return 0;
}