6
HDU2176 取(m堆)石子游戏（尼姆博弈）
source link: https://arminli.com/hdu2176/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Armin's Blog
HDU2176 取(m堆)石子游戏（尼姆博弈）
March 09, 2016
也是求获胜的取法次数。。
#include<cstring>
#include<cstdio>
#include<cstring>
#include<cmath>
#include <vector>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
int a[200005];
int main(){
//freopen("a.txt", "r", stdin);
int n;
while(cin >> n && n){
int sum = 0;
for(int i = 0; i < n; i++){
scanf("%d", &a[i]);
sum ^= a[i];
}
if(!sum) cout << "No" << endl;
else{
cout << "Yes" << endl;
for(int i = 0; i < n; i++){
int k = sum^a[i];
if(k < a[i]){
cout << a[i] << " " << k << endl;
}
}
}
}
return 0;
}
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK