zoukankan      html  css  js  c++  java
  • Matches Game

    Matches Game

    http://poj.org/problem?id=2234

    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 12309   Accepted: 7172

    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
    
     1 #include<iostream>
     2 using namespace std;
     3 #define lson l,mid,rt<<1
     4 #define rson mid+1,r,rt<<1|1
     5 #define sqr(x) ((x)*(x))
     6 #define maxn 100005
     7 typedef long long ll;
     8 typedef unsigned long long ull;
     9 const ull MOD=257;
    10 /*#ifndef ONLINE_JUDGE
    11         freopen("1.txt","r",stdin);
    12 #endif */
    13 
    14 int a[25];
    15 
    16 
    17 int main(){
    18     #ifndef ONLINE_JUDGE
    19      //   freopen("1.txt","r",stdin);
    20     #endif
    21     std::ios::sync_with_stdio(false);
    22     int n;
    23     while(cin>>n){
    24         int ans=0;
    25         for(int i=1;i<=n;i++) {
    26             cin>>a[i];
    27             ans^=a[i];
    28         }
    29         if(!ans) cout<<"No"<<endl;
    30         else cout<<"Yes"<<endl;
    31 
    32     }
    33 }
    View Code
  • 相关阅读:
    函数之装饰器
    前端笔记之css
    前端笔记之html
    python之函数
    python之文件操作
    python基础知识
    ovirt一种基于kvm的开源虚拟化软件
    python2与3的区别
    TP框架设置验证码
    js原生子级元素阻止父级元素冒泡事件
  • 原文地址:https://www.cnblogs.com/Fighting-sh/p/10498622.html
Copyright © 2011-2022 走看看