首页 > Windows开发 > 详细

HDU-2509 Be the Winner

时间:2014-01-14 19:46:17      阅读:568      评论:0      收藏:0      [点我收藏+]

http://acm.hdu.edu.cn/showproblem.php?pid=2509

Be the Winner

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

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
bubuko.com,布布扣
 1 #include<iostream>
 2 #include<algorithm>
 3 using namespace std;
 4 int main()
 5 {
 6     int   n,i,a[50];
 7     int temp,ans;
 8     while(~scanf("%d",&n))
 9       {
10           temp=0;
11           ans=-1;
12         for(i=0;i<n;i++)
13         {
14             scanf("%d",&a[i]);
15             if(i==0)
16                 ans=a[i];
17             else
18                 ans=ans^a[i];
19             if(a[i]>1)
20                  temp=1;
21         }
22         if(temp==0)
23         {
24             if(n%2==1)
25               printf("No\n");
26             else
27               printf("Yes\n");
28         }
29         else
30         {
31             if(ans==0)
32               printf("No\n");
33             else
34               printf("Yes\n");
35             
36         }
37     }
38     return 0;
39 }
bubuko.com,布布扣

 

HDU-2509 Be the Winner

原文:http://www.cnblogs.com/cancangood/p/3512825.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!