hdu2509Be the Winner(反nim博弈)

2021-07-02 16:42

阅读：445

标签：case rate std ons \n tput 异或 others rip

Be the Winner

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

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

Output

If a winning strategies can be found, print a single line with "Yes", otherwise print "No".

Sample Input

2 2

Sample Output

Yes

题意：有n堆苹果，每堆有数个。两个人轮流取，每次至少取一个，取走最后一个的算输。

题解：是反nim博弈。先手必胜的两个结论：（1）每堆苹果都只有一个，而且有偶数堆（异或和为0），那么先手必胜。（2）至少有一堆苹果中个数超过一个，那么异或和不为0，先手必胜。

https://www.cnblogs.com/SilverNebula/p/5658629.html 顶

 1 #include 2 using namespace std;
 3 int main() {
 4     int n;
 5     while(~scanf("%d",&n))
 6     {
 7         int ans=0,ai,num=0;
 8         for(int i=0;i)
 9         {
10             scanf("%d",&ai);
11             ans^=ai;
12             if(ai>1)num=1;
13         }
14         if(num)
15         {
16             if(ans==0)printf("No\n");
17             else printf("Yes\n");
18         }
19         else
20         {
21             if(ans==0)printf("Yes\n");
22             else printf("No\n");
23         }
24     }
25     return 0;
26 }

hdu2509Be the Winner(反nim博弈)

标签：case rate std ons \n tput 异或 others rip

原文地址：https://www.cnblogs.com/fqfzs/p/9909351.html

上一篇：《21天学通C#生成XML文件

下一篇：《21天学通C#》Write和WriteLine的区别

文章来自：搜素材网的编程语言模块，转载请注明文章出处。
文章标题：hdu2509Be the Winner(反nim博弈)
文章链接：http://soscw.com/index.php/essay/100870.html

亲，登录后才可以留言！

hdu2509Be the Winner(反nim博弈)

Be the Winner

评论

热门文章

推荐文章

最新文章

置顶文章