【尼姆博弈】HDOJ1907

做之前参考理解博弈思想：https://blog.csdn.net/acm_cxlove/article/details/7854530
同一类型：HDOJ2509

题目

#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

#include <stdio.h>
#include<iostream>
using namespace std;
int n;
int aa[10001];
int main()
{
    int m;
    cin>>n;
    while(n--)
    {
        m=0;
        int num=0;
        int countt=0;
        scanf("%d",&m);
        for(int i=1; i<=m; i++)
        {
            scanf("%d",&aa[i]);
            num^=aa[i];
            if(aa[i]==1)
            {
                countt++;
            }
        }
       // cout<<num<<endl;
        if(countt==m)
        {
            if(countt%2)
            {
                printf("Brother\n");
            }
            else
                  printf("John\n");
            continue;
        }
        if(m==1)
        {
             printf("John\n");
            continue;
        }
        if(num)
        {
            printf("John\n");
        }
        else
        {
              printf("Brother\n");
        }
    }
    return 0;
}