zoukankan      html  css  js  c++  java
  • poj 2234 尼姆博弈

    Matches Game
     

    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

    当石子堆数为n堆时,则推广为当对每堆的数目进行亦或之后值为零是必败态.

    #include <cstdio>
    using namespace std;
    int a[30];
    
    int main(){
    	int n;
    	while(scanf("%d",&n)!=EOF){
    		for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    		for(int i=2;i<=n;i++)a[1]^=a[i];
    		if(a[1]==0)puts("No");
    		else puts("Yes");
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    看书笔记《python基础》__1
    MQTT
    杂记
    类型转化
    soc
    时钟同步
    设置地址
    清理日志
    pandas_matplot_seaborn
    Qt_Quick开发实战精解_4
  • 原文地址:https://www.cnblogs.com/codetogether/p/13361758.html
Copyright © 2011-2022 走看看