http://www.lydsy.com/JudgeOnline/problem.php?id=3687
抽象了的01背包,不过第一个问题。。。。。。。
//#define _TEST _TEST
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
using namespace std;
/************************************************
Code By willinglive
************************************************/
/
#define rep(i,l,r) for(int i=l,___t=(r);i<=___t;i++)
#define per(i,r,l) for(int i=r,___t=(l);i>=___t;i--)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define LL long long
#define INE(i,u,e) for(int i=head[u];~i;i=e[i].next)
inline const LL getint()
{
LL r=0,k=1;char c=getchar();
for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';
return k*r;
}
/
int n;
bitset<2000001>bit;
/
/
void solve()
{
int x;
int ans=0;
scanf("%d",&n);
bit[0]=1;
while(n--)
{
scanf("%d",&x);
bit^=bit<<x;
}
rep(i,0,2000000) if(bit[i]) ans^=i;
printf("%d\n",ans);
}
/
int main()
{
#ifndef _TEST
freopen("std.in","r",stdin); freopen("std.out","w",stdout);
#endif
solve();
return 0;
}