题目链接:https://cn.vjudge.net/contest/269106#problem/Q
题目大意:
m堆石子,两人轮流取.只能在1堆中取.取完者胜.先取者负输出No.先取者胜输出Yes,然后输出怎样取子.例如5堆 5,7,8,9,10先取者胜,先取者第1次取时可以从有8个的那一堆取走7个剩下1个,也可以从有9个的中那一堆取走9个剩下0个,也可以从有10个的中那一堆取走7个剩下3个.
解题思路:
尼姆博弈,即所有数异或和为0是必败态,否则为必胜态,首先异或一遍,为0输出No,不为零输出Yes,然后遍历石子数,sum ^= a[i],则sum为除第i堆石子外的异或和,易知sum ^ sum = 0,故当sum < a[i]时,第i堆石子可已走a[i] - sum个石子,使对手必败。
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[200005];
int main()
{
ll n, sum, i, left;
while(scanf("%lld", &n) != EOF)
{
if(n == 0)break;
sum = 0;
for(i = 1; i <= n; i++)
{
scanf("%lld", &a[i]);
sum ^= a[i];
}
if(sum == 0)
{
printf("No\n");
}
else
{
printf("Yes\n");
for(i = 1; i <= n; i++)
{
sum ^= a[i];
left = sum;
if(left <= a[i])
{
printf("%lld %lld\n", a[i], left);
}
sum ^= a[i];
}
}
}
return 0;
}