hdu2509 Be the Winner 博弈

最新推荐文章于 2020-07-29 15:07:27 发布

weixin_33755557

最新推荐文章于 2020-07-29 15:07:27 发布

阅读量61

点赞数

原文链接：http://www.cnblogs.com/cenariusxz/p/6592412.html

版权

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).

博弈

 1 #include<stdio.h>
 2 
 3 int main(){
 4     int n;
 5     while(scanf("%d",&n)!=EOF){
 6         int i,sum=0,num=0;
 7         for(i=1;i<=n;i++){
 8             int a;
 9             scanf("%d",&a);
10             if(a>1)num++;
11             sum^=a;
12         }
13         if((num==0&&sum==0)||(sum>0&&num>0))printf("Yes\n");
14         else printf("No\n");
15     }
16     return 0;
17 }