John （尼姆博弈）

zzcblogs

于 2017-05-20 11:00:06 发布

阅读量311

点赞数

分类专栏：博弈论文章标签：尼姆博弈博弈论

本文链接：https://blog.csdn.net/zzcblogs/article/details/72571315

版权

博弈论专栏收录该内容

10 篇文章 0 订阅

订阅专栏

John

Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)

Total Submission(s): 63 Accepted Submission(s): 43

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

Sample Output

John
Brother

      
      
       
       先手胜当且仅当
      
      
      
      
      
      
       
       （1）所有堆石子数都为1且游戏的SG值为0 ，（2）存在某堆石子数大于1且游戏的SG值不为0
      
      
      
      
      
      
       
        
       
         
       
       证明：
      
      
      
      
      
      
       
       （1）若所有堆石子数都为1且SG值为0，则共有偶数堆石子，故先手胜。
      
      
      
      
      
      
       
       （2）
      
      
      
      
      
      
       
       i)只有一堆石子数大于1时，我们总可以对该堆石子操作，使操作后石子堆数为奇数且所有堆得石子数均为1
      
      
      
      
      
      
       
       ii)有超过一堆石子数大于1时，先手将SG值变为0即可，且总还存在某堆石子数大于1
      
      
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
int main() {
    int T, n, m;
    int sum;
    int flag;
    cin >> T;
    while (T--) {
        flag = 0;
        sum = 0;
        cin >> m;
        for (int i = 0; i < m; ++i) {
            cin >> n;
            if (n > 1)
                flag = 1;
            sum ^= n;
        }
        
        if (flag) {
            if (sum == 0)
                cout << "Brother" << endl;
            else
                cout << "John" << endl;
        }
        else {
            if (m&1)
                cout << "Brother" << endl;
            else
                cout << "John" << endl;
        }
    }
}