HDU1907 John 【博弈】

最新推荐文章于 2020-10-07 16:37:01 发布

星_尘

最新推荐文章于 2020-10-07 16:37:01 发布

阅读量390

点赞数

分类专栏： hduoj 文章标签： hduoj 博弈

本文链接：https://blog.csdn.net/travel_1/article/details/45169475

版权

hduoj 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

John

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

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 时，看奇偶.
  
  
  
  
   
   
   
   #include<stdio.h>
int main()
{
	int t;
	int n,i;
	int ans;
	int flag;
	scanf("%d",&t);
	while(t--)
	{
		flag=0;
		ans=0;
		scanf("%d",&n);
		while(n--)
		{
			scanf("%d",&i);
			if(i>1)
			{
				flag=1;
			}
			ans^=i;
		}
		if((flag&&ans)||(!flag&&!ans))
		{
			printf("John\n");
		}
		else
		{
			printf("Brother\n");
		}
	}
	return 0;
}