hdu1907(尼姆博弈)

原创 2013年12月04日 13:29:23

John

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


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
 

Source
 
     尼姆博弈模型。若火柴异或值为0,为利他态;否则为利己态。本题较传统模拟有点小变化,即取到最后一根者败。若为利他态且为1的堆为0,则胜;若为利己态且为1的堆个数不为0,也胜。其他的输。在双方都采取最优策略的情况下。
import java.util.Scanner;

public class hdu1907 {
	public static void main(String[] str)
	{
		Scanner key=new Scanner(System.in);
		int n,i,T,num;
		int [] pile=new int[500];
		T=key.nextInt();
		while(T!=0)
		{
			T--;
			num=0;
			n=key.nextInt();
			for(i=0;i<n;i++)
				pile[i]=key.nextInt();
			int ans;
			for(ans=0,i=0;i<n;i++)
			{	
				if(pile[i]>1)num++;
				ans^=pile[i];
			}
			
			if((ans==0&&num==0)||(ans!=0&&num!=0))
				System.out.println("John");
			else 
				System.out.println("Brother");
		}
	}
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

hdu1907 John (尼姆博弈)

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

John(HDU 1907) —— 尼姆博弈

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

ACM-尼姆博弈之John——hdu1907

ACM 尼姆博弈 John hdu1907

hdu 1907(尼姆博弈)

尼姆博弈(Nimm Game):简单地说
  • YJX_xx
  • YJX_xx
  • 2014年05月03日 15:12
  • 943

hdu 1907 尼姆博弈变形 最后取得人为输

Problem Description Little John is playing very funny game with his younger brother. There is one b...
  • winycg
  • winycg
  • 2016年03月28日 21:04
  • 149

hdu 1850 Being a Good Boy in Spring Festival 博弈论之尼姆博弈,,都被自己蠢哭了!

Problem Description 一年在外 父母时刻牵挂 春节回家 你能做几天好孩子吗 寒假里尝试做做下面的事情吧 陪妈妈逛一次菜场 悄悄给爸爸买个小礼物 主动地 强烈地 要求洗一次碗 某一天...

ACM-尼姆博弈之Being a Good Boy in Spring Festival——hdu1850

ACM 尼姆博弈 Being a Good Boy in Spring Festival hdu1850

hdu-2176-取(m堆)石子游戏-尼姆博弈 -输出取法

取(m堆)石子游戏 Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...

尼姆博弈 (附:HDU1850)

尼姆博弈: 有三堆各若干个物品,两个人轮流从某一堆取任意多的物品,规定每次至少取一个,多者不限,最后取光者得胜。 这种情况与二进制有着很大的关系, 我们用(a,b,c)来表示某种局势, 那么(...

HDU-1850-Being a Good Boy in Spring Festival(尼姆博弈)

Being a Good Boy in Spring Festival Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdu1907(尼姆博弈)
举报原因:
原因补充:

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