HDU 2509 Nim博弈之分堆

#include <iostream>
#include <algorithm>
#define ss(a)  scanf("%d",&a)
#define ss64(a)  scanf("%I64d",&a)
using namespace std;

int main()
{
	int i,n,m,sum,cnt,j;
	while(~ss(n))
	{
		int temp=0;
		for (i=0,sum=0;i<n;i++)
        {
			ss(m);
			if(m>1) temp=1;
            sum ^=m;
		}
		if ((sum && temp) || (!sum && !temp))
		{
			cout<<"Yes"<<endl;
		}
		else
		{		
			cout<<"No"<<endl;			
		}
	}
    return 0;
}

此题和1907是同一类题目，都是可以对某一堆进行分堆。

Be the Winner

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

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

ECJTU 2008 Autumn Contest