hdoj 1907 John(尼姆博奕变形)

最新推荐文章于 2019-11-01 17:28:55 发布

SimonCoder

最新推荐文章于 2019-11-01 17:28:55 发布

阅读量783

点赞数

分类专栏： # |--hdoj # |--博弈

本文链接：https://blog.csdn.net/SimonCoder/article/details/40474675

版权

|--hdoj 同时被 2 个专栏收录

134 篇文章 0 订阅

订阅专栏

|--博弈

9 篇文章 0 订阅

订阅专栏

http://acm.hdu.edu.cn/showproblem.php?pid=1907

John

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

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

#include<stdio.h>
int main()
{
	int T,N,SG,i,j,sum;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&N);
		for(i=0,SG=0,sum=0;i<N;i++)
		{
			scanf("%d",&j);
			SG^=j;
			if(j!=1)
			sum+=1;
		}
		if(sum==0&&SG==0||sum>0&&SG!=0)
		printf("John\n");
		else
		printf("Brother\n");
	}
	return 0;
}