zoukankan      html  css  js  c++  java
  • POJ 2234 Matches Game 博弈论水题 Nim模型

    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



    Nim模型,操作规则一点改动都没有。
    直接异或。

     1 #include<cstdio>
     2 
     3 int main()
     4 {
     5     int m;
     6     while(scanf("%d",&m)!=EOF)
     7     {
     8         int temp;
     9         int ans=0;
    10 
    11         for(int i=0;i<m;i++)
    12         {
    13             scanf("%d",&temp);
    14             ans^=temp;
    15         }
    16         if(ans)
    17             printf("Yes
    ");
    18         else
    19             printf("No
    ");
    20     }
    21 
    22     return 0;
    23 }
    View Code





     
  • 相关阅读:
    关于我的介绍
    关于这周的作业
    关于这周的学习
    每周学习
    关于这周程序设计
    关于这周的总结
    关于这周的学习
    随机抽签程序报告
    Mysql的主从复制原理及部署
    项目架构脚本
  • 原文地址:https://www.cnblogs.com/-maybe/p/4510919.html
Copyright © 2011-2022 走看看