ZOJ 3113 John（Nim博弈）

John

Time limit1000 msMemory limit32768 kB

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.

Constrains:

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

题意
t组数据，每组数据给出一个n,和n个颜色糖的数量。每次每人可以吃任意一种颜色的糖的任意数量。求谁不会吃到最后一个。

题解
尼姆博弈，只是需要特判一下全是1的情况。

代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <cstring>
#include <string>

using namespace std;
#define MAX(a,b) a > b ? a : b
#define MIN(a,b) a < b ? a : b
const int maxn = 100000;
const int MOD = 1e9;
const int INF = 0x3f3f3f3f;

int main()
{
    int t;
    cin>>t;

    while(t--){
        int n,temp = 0,fg = 0;
        scanf("%d",&n);
        for(int i = 1; i <= n; i++){
            int x;
            scanf("%d",&x);
            temp ^= x;
            if(x > 1){
                fg = 1;
            }
        }
        if(fg == 0){
            if(n&1){
                cout<<"Brother"<<endl;
            }
            else{
                cout<<"John"<<endl;
            }
            
            continue;
        }
        if(temp == 0){
            cout<<"Brother"<<endl;
        }
        else{
            cout<<"John"<<endl;
        }
    }
    return 0;
}