HDU1907 John Nim游戏

原创 2016年08月29日 20:05:56

题目链接:HDU1907

John

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 4425    Accepted Submission(s): 2531


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
 

题意:一堆不同颜色的M&M糖,2个人轮流吃,一次只能吃若干颗相同颜色的糖,吃完最后一块的输,问谁会赢。

题目分析:这是取完的人判为输的Nim游戏,有专门的结论,设所有堆个数异或为0是T态,反之为S态。设单堆个数多于1个为充裕堆,充裕堆多于1个为2态,其余为1和0态。这里S2,S1,T0态都是必胜态,因此只需判断初始状态是什么状态即可。

//
//  main.cpp
//  HDU1907
//
//  Created by teddywang on 2016/8/29.
//  Copyright © 2016年 teddywang. All rights reserved.
//

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
    int T,n,a[100];
    cin>>T;
    while(T--)
    {
        cin>>n;
        int ans=0,flag=0;
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
            if(a[i]>1) flag++;
            ans^=a[i];
        }
        if((flag>=1&&ans!=0)||(flag==0&&ans==0))
            cout<<"John"<<endl;
        else cout<<"Brother"<<endl;
    }
}

HDU 1907 John(Nim游戏 取完为输)

John Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Sub...

hdu 1907 John(anti-nim)

John Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Sub...

HDU 1907 John Nim博弈

John Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Sub...

(hdu 1907)John (Misère Nim,Nim博弈的变形)

Little John is playing very funny game with his younger brother. There is one big box filled with M&...

hdu 1907 John(取火柴游戏)

尼姆博奕(Nimm Game): 有三堆各有若干个物品,两个人轮流从某一堆取任意多的物品,规定每次至少取一个,多者不限,最后取光者得胜。       用(a , b , c)表示某种局势,首先(...
  • LiWen_7
  • LiWen_7
  • 2012年09月03日 16:59
  • 1234

hdu 1907/2509 (Nim 游戏变种)

这两题都是 Nim 游戏的变种。设第i堆的石子数位 Ai, SUM = A1 xor A2 xor... xor An  。设 SUM 非零为 S 态, SUM = 0 为 T 态。 自己刚开始以为...

HDOJ 1907 John (nim博弈)

John Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Sub...

HDOJ 1907 John nim博弈

John Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Sub...
  • kdwycz
  • kdwycz
  • 2014年04月03日 09:03
  • 712

POJ 2234 Matches Game/hdu 1907 John(尼姆博奕中取完胜与取完负的模板)

Matches Game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 9535   A...
  • acm_cxq
  • acm_cxq
  • 2016年07月03日 20:16
  • 406

hdu1907John尼姆博弈

http://acm.hdu.edu.cn/showproblem.php?pid=1907Problem Description Little John is playing very funny...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU1907 John Nim游戏
举报原因:
原因补充:

(最多只允许输入30个字)