关闭

poj2234(尼姆博弈)

476人阅读 评论(0) 收藏 举报
分类:
 
 
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");
		}
	}
}

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:380729次
    • 积分:8593
    • 等级:
    • 排名:第2224名
    • 原创:476篇
    • 转载:54篇
    • 译文:0篇
    • 评论:106条
    我的基本信息
      详细资料
      姓名:XuJin
      专业:计算机科学与技术
      工作:帝都码农
      专注:算法、 数据结构
      github:https://github.com/XuJin1992
    文章分类