Be the Winner
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 3 Accepted Submission(s) : 3
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.<br>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 <br>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).<br>
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.<br>
Output
If a winning strategies can be found, print a single line with "Yes", otherwise print "No".<br>
Sample Input
2<br>2 2<br>1<br>3<br>
Sample Output
No<br>Yes<br>
Source
ECJTU 2008 Autumn Contest