HDU 2509 nim博弈

时间：2023-03-09 05:44:56
HDU 2509 nim博弈

Be the Winner

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3326    Accepted Submission(s): 1853

Problem 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
Source
题意：同hdu1907  链接
题解：
 /******************************

 code by drizzle

 blog: www.cnblogs.com/hsd-/

 ^ ^    ^ ^

  O      O

 ******************************/

 #include<bits/stdc++.h>

 #include<map>

 #include<set>

 #include<cmath>

 #include<queue>

 #include<bitset>

 #include<math.h>

 #include<vector>

 #include<string>

 #include<stdio.h>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 #pragma comment(linker, "/STACK:102400000,102400000")

 using namespace std;

 #define  A first

 #define B second

 const int mod=;

 const int MOD1=;

 const int MOD2=;

 const double EPS=0.00000001;

 typedef __int64 ll;

 const ll MOD=;

 const int INF=;

 const ll MAX=1ll<<;

 const double eps=1e-;

 const double inf=~0u>>;

 const double pi=acos(-1.0);

 typedef double db;

 typedef unsigned int uint;

 typedef unsigned long long ull;

 int n;

 int ans,cou;

 int main()

 {

     while(scanf("%d",&n)!=EOF)

     {

         ans=cou=;

         int exm;

         for(int j=; j<=n; j++)

         {

             scanf("%d",&exm);

             ans^=exm;

             if(exm>)

                 cou++;

         }

         if((ans==&&cou>=)||(cou==&&ans%!=))

             printf("No\n");

         else

             printf("Yes\n");

     }

     return ;

 }

相关文章