题解: 听说这题就是考bitset简单应用 吓得我百度了一下
然而我还是RE了 , 最后网上抄了一份交了。
贴上代码:
/**************************************************************
Problem: 3687
User: iloi
Language: C++
Result: Accepted
Time:7440 ms
Memory:2192 kb
****************************************************************/
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<bitset>
#define maxn 2000010
using namespace std;
int n;
long long ans;
bitset<maxn> f;
int main()
{
scanf("%d",&n);
f[0]=1;
for (int i=1;i<=n;i++)
{
int x;
scanf("%d",&x);
f=f^(f<<x);
}
for (int i=1;i<=2000000;i++)
if (f[i]) ans^=i;
printf("%lld\n",ans);
return 0;
}