HDU 2176 取(m堆)石子游戏（博弈）

最新推荐文章于 2019-03-07 20:59:51 发布

左眼皮跳跳~

最新推荐文章于 2019-03-07 20:59:51 发布

阅读量281

点赞数

分类专栏：博弈

本文链接：https://blog.csdn.net/u014737310/article/details/48528023

版权

博弈专栏收录该内容

9 篇文章 0 订阅

订阅专栏

取(m堆)石子游戏

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2283 Accepted Submission(s): 1324

Problem Description

m堆石子,两人轮流取.只能在1堆中取.取完者胜.先取者负输出No.先取者胜输出Yes,然后输出怎样取子.例如5堆 5,7,8,9,10先取者胜,先取者第1次取时可以从有8个的那一堆取走7个剩下1个,也可以从有9个的中那一堆取走9个剩下0个,也可以从有10个的中那一堆取走7个剩下3个.

Input

输入有多组.每组第1行是m,m<=200000. 后面m个非零正整数.m=0退出.

Output

先取者负输出No.先取者胜输出Yes,然后输出先取者第1次取子的所有方法.如果从有a个石子的堆中取若干个后剩下b个后会胜就输出a b.参看Sample Output.

Sample Input

Sample Output

Author

Zhousc

Source

ECJTU 2008 Summer Contest

Recommend

lcy | We have carefully selected several similar problems for you: 2177 1730 1907 1729 2509

Statistic | Submit | Discuss | Note

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>

#define L(x) (x<<1)
#define R(x) (x<<1|1)
#define MID(x,y) ((x+y)>>1)

#define bug printf("hihi\n")

#define eps 1e-7

typedef __int64 ll;

using namespace std;
#define INF 10005

#define N 200005

int a[N];
int n;
vector<pair<int,int> >ans;

int main()
{
    int i,j;
    while(scanf("%d",&n),n)
    {
        int s=0;
        for(i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            s^=a[i];
        }

        ans.clear();
        for(int i=1;i<=n;i++)
        {
           int t=s^a[i];
           if(t<=a[i])
             ans.push_back(make_pair(a[i],t));
        }
        if(s==0)
            printf("No\n");
        else
        {
            printf("Yes\n");
            for(int i=0;i<ans.size();i++)
                printf("%d %d\n",ans[i].first,ans[i].second);
        }
    }
    return 0;
}