HDU2509 Be the Winner Nim博弈

原创 2016年08月29日 21:20:03
题目链接:HDU2509

Be the Winner

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


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
 

题意:有几堆苹果,每堆都放成一列,一次可以在一堆中取连续的几个,最后取完的为负,问是否有必胜的算法。
题目分析:这题有取完后拆成2堆的情况,看似复杂了,其实和HDU1907是一回事,考虑S2,S1,S0与T2,T0态相互转换的过程,发现多分出堆的情况只存在于有充裕堆的情况而此时不会影响到S2到T2,S1到T0的互相转化,也就是说多分出堆对游戏结果没有任何影响,沿用上题结论即可。
//
//  main.cpp
//  HDU2509
//
//  Created by teddywang on 2016/8/29.
//  Copyright © 2016年 teddywang. All rights reserved.
//

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int T,m,n;
int main()
{
    while(cin>>n)
    {
        int c[200];
        int ans=0,flag=0;
        for(int i=0;i<n;i++)
        {
            cin>>c[i];
            ans^=c[i];
            if(c[i]>1) flag++;
        }
        if((ans&&flag>=1)||(ans==0&&flag==0)) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
}


HDU 2509 Be the Winner nim博弈

Be the Winner Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

HDU 2509 Be the Winner(Anti-Nim)

Problem Description Let’s consider m apples divided into n groups. Each group contains no more than...

HDU2509 Nim博弈 附定理

Nim博弈变形(anti-nim) 题目大意:有n堆苹果,每堆有mi个。两人轮流取,每次可以从一堆苹果中取任意连续个苹果,最后取光者为输。Fra先下,问是否可以获胜。 算法如下: ...

hdu 1907 && hdu 2509(Nim博弈)

其实我都是一直叫它(尼美博弈) 模型: 给你N堆,每堆数目是确定的(输入),每次从一堆取一个,多者不限,最多取完一堆。有两人AB,A先手,规定最后一个取完者赢(输)。问先后手哪个赢(输)。(假定两...

杭电2509-Be the Winner

Be the Winner Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) To...

hdu 1907/2509 (Nim 游戏变种)

这两题都是 Nim 游戏的变种。设第i堆的石子数位 Ai, SUM = A1 xor A2 xor... xor An  。设 SUM 非零为 S 态, SUM = 0 为 T 态。 自己刚开始以为...

HDU 5754 Life Winner Bo(找规律 + 威佐夫博弈)--2016 Multi-University Training Contest 3

传送门Bo is a "Life Winner".He likes playing chessboard games with his girlfriend G. The size of the...

(HDU 5754)2016 Multi-University Training Contest 3 Life Winner Bo (博弈/DP)

题意在一个n×mn\times m的棋盘左上角有一个棋子(四种类型之一),要求移动到右下角(只能往右或者往下),问都采取最优策略的情况下,先手方是否必胜(或者平局)。思路从来没做过这么奇怪的博弈题,写...

HDU 5754 Life Winner Bo(多校3 各种博弈)

这道题的四中走法相当于四种博弈,其实分开来看并不是很难,只是这道题把他们融合到一块了。很具有代表性。...

HDU 5754 Life Winner Bo (各种博弈融合)

题目链接:HDU 5754 题面: Life Winner Bo Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU2509 Be the Winner Nim博弈
举报原因:
原因补充:

(最多只允许输入30个字)