poj2234(尼姆博弈)

原创 2013年12月04日 11:54:12
 
 
Matches Game
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 7845   Accepted: 4517

Description

Here is a simple game. In this game, there are several piles of matches and two players. The two player play in turn. In each turn, one can choose a pile and take away arbitrary number of matches from the pile (Of course the number of matches, which is taken away, cannot be zero and cannot be larger than the number of matches in the chosen pile). If after a player’s turn, there is no match left, the player is the winner. Suppose that the two players are all very clear. Your job is to tell whether the player who plays first can win the game or not.

Input

The input consists of several lines, and in each line there is a test case. At the beginning of a line, there is an integer M (1 <= M <=20), which is the number of piles. Then comes M positive integers, which are not larger than 10000000. These M integers represent the number of matches in each pile.

Output

For each test case, output "Yes" in a single line, if the player who play first will win, otherwise output "No".

Sample Input

2 45 45
3 3 6 9

Sample Output

No
Yes

Source

POJ Monthly,readchild
 
  尼姆博弈模型
import java.util.Scanner;


public class poj2234 {
	public static void main(String[] str)
	{
		Scanner key=new Scanner(System.in);
		int n,i;
		int [] pile=new int[30];
		while(key.hasNext())
		{
			n=key.nextInt();
			for(i=0;i<n;i++)
				pile[i]=key.nextInt();
			int ans=pile[0];
			for(i=1;i<n;i++)
			{	
				ans^=pile[i];
			}
			
			if(ans!=0)
				System.out.println("Yes");
			else 
				System.out.println("No");
		}
	}
}

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

相关文章推荐

转:poj 1704 阶梯尼姆博弈

题目大意:每个测试点最多有T(1
  • AQ14AQ1
  • AQ14AQ1
  • 2014年03月07日 09:28
  • 509

poj 2975 Nim 尼姆博弈,求取胜方案数

Nim is a 2-player game featuring several piles of stones. Players alternate turns, and on his/her tu...

POJ 1704 Georgia and Bob(尼姆博弈)

Description Georgia and Bob decide to play a self-invented game. They draw a row of grids on pap...

[POJ 1704] Georgia and Bob (尼姆博弈变形)

POJ 1704 Georgia and Bob  (尼姆博弈变形) 题目链接: http://poj.org/problem?id=1704 题目大意: Georgia和Bob两个人玩游戏,他们设计...
  • SIOFive
  • SIOFive
  • 2013年12月03日 23:46
  • 1082

POJ 1704 Georgia and Bob 阶梯尼姆博弈

POJ 1704 Georgia and Bob 阶梯尼姆博弈 Georgia and Bob decide to play a self-invented game. They draw a row...
  • Mrx_Nh
  • Mrx_Nh
  • 2017年04月12日 10:08
  • 164

博弈论基础知识: 巴什博奕+威佐夫博奕+尼姆博弈(及Staircase)

博弈论基础知识: 巴什博奕+威佐夫博奕+尼姆博弈(及Staircase); (一)巴什博奕(Bash Game): 只有一堆n个物品,两个人轮流从这堆物品中取物,规定每次至少取一个,最多取m个...
  • acm_cxq
  • acm_cxq
  • 2016年07月03日 17:42
  • 350

hdu 1536 S-Nim(经典尼姆博弈)

经典题

杭电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...

尼姆博弈问题+sg函数

具体的sg函数见链接: 点击打开链接 sg函数模板 int f[105],sg[1005];//f[]为所要拿取的球数 int sg_dfs(int x) { if(sg[x]!=-...
  • winycg
  • winycg
  • 2016年04月05日 23:45
  • 455

HDOJ1850尼姆博弈(输出取法)

这道题和上一个差不多,就是尼姆博弈的应用,属于基础的尼姆博弈,除了判断是否是胜利外,还要输出胜态下第一步的可走的步数,即需要和原来的值相异或 题目: 小游戏:桌子上有M堆扑克牌;每堆牌的数量分别为N...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj2234(尼姆博弈)
举报原因:
原因补充:

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