zoukankan      html  css  js  c++  java
  • POJ 2234 Matches Game

    Matches Game
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 7567   Accepted: 4327

    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堆石子,每堆M个,每次可以从任意一堆中取走任意个石子,问先手能否获胜。
    #include <stdio.h>
    #include <iostream>
    #include <string.h>
    using namespace std;
    
    int main()
    {
        int ans, n, pile[30];
        while(scanf("%d", &n) != EOF)
        {
            ans = 0;
            memset(pile, 0, sizeof(pile));
            for (int i = 0; i < n; i++)
            {
                scanf("%d", &pile[i]);
                ans ^= pile[i];
            }
            if (ans == 0)
            {
                printf("No
    ");
            }
            else
            {
                printf("Yes
    ");
            }
        }
        return 0;
    }
  • 相关阅读:
    TP
    vim manual 个人笔记
    关于动画属性
    过渡
    关于 css3 的filter属性
    html 中行内元素和块级元素区别
    JS以不同的格式保存文件内容
    64位Kali无法顺利执行pwn1问题的解决方案
    鱼龙混杂 · 数据结构学习笔记(01)
    Terminal(终端) 在 OS X下如何快速调用
  • 原文地址:https://www.cnblogs.com/lzmfywz/p/3266427.html
Copyright © 2011-2022 走看看