zoukankan      html  css  js  c++  java
  • HDU 2509——anti-nim

    题目:

    Description

    Let's consider m apples divided into n groups. Each group contains no more than 100 apples, arranged in a line. You can take any number of consecutive apples at one time. 
    For example "@@@" can be turned into "@@" or "@" or "@ @"(two piles). two people get apples one after another and the one who takes the last is 
    the loser. Fra wants to know in which situations he can win by playing strategies (that is, no matter what action the rival takes, fra will win).

    Input

    You will be given several cases. Each test case begins with a single number n (1 < n <= 100), followed by a line with n numbers, the number of apples in each pile. There is a blank line between cases. 

    Output

    If a winning strategies can be found, print a single line with "Yes", otherwise print "No".

    Sample Input

    2
    2 2
    1 3

    Sample Output

    No
    Yes
    分析:
    anti-nim
     1 #include<cstdio>
     2 int main()
     3 {
     4     int n,a[100],ans,flag;
     5     while(scanf("%d",&n)==1)
     6     {
     7         ans=0;
     8         flag=1;
     9         for(int i=0;i<n;i++)
    10         {
    11             scanf("%d",&a[i]);
    12             if(a[i]!=1) flag=0;
    13             ans^=a[i];
    14         }
    15         if(flag)
    16         {
    17             if(n&1)
    18                 printf("No
    ");
    19             else
    20                 printf("Yes
    ");
    21         }
    22         else
    23         {
    24             if(ans)
    25                 printf("Yes
    ");
    26             else
    27                 printf("No
    ");
    28         }
    29     }
    30     return 0;
    31 }
    View Code
  • 相关阅读:
    spark的map和mapPartitions
    scala 语法速查
    spark 在yarn模式下提交作业
    spark的wordcount
    spark安装
    hadoop mapreduce求解有序TopN(高效模式)
    hadoop 自定义OutputFormat
    ONI无法启动: Uh oh! Unable to launch Neovim...
    Macbook外接显示器模糊解决方法
    macOS: sudo : Operation not permitted
  • 原文地址:https://www.cnblogs.com/forwin/p/4890472.html
Copyright © 2011-2022 走看看