链接:http://acm.hdu.edu.cn/showproblem.php?pid=2509
题意:给出n堆苹果,每次可以选择一堆苹果取出一些(至少1个,最多整堆),被取的那一堆剩下的x个苹果可以保持为1堆或者分为2堆。最后取完的人输。
分析:同hdu1907http://blog.csdn.net/fsss_7/article/details/51374659
代码:
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=100010;
const int MAX=1000000100;
const int mod=100000000;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
typedef double db;
typedef unsigned long long ull;
int main()
{
int a,i,n,g,xo;
while (scanf("%d", &n)!=EOF) {
g=xo=0;
for (i=1;i<=n;i++) {
scanf("%d", &a);
xo^=a;if (a>1) g++;
}
if ((g==0&&n&1)||(g>1&&!xo)) printf("No\n");
else printf("Yes\n");
}
return 0;
}