BZOJ 3687: 简单题 动态规划+bitset

code:

#include <cstdio>
#include <bitset> 
#include <algorithm>
#define N 2000007 
#define ll long long 
#define setIO(s) freopen(s".in","r",stdin)  
using namespace std;
bitset<N>f;  
int main() 
{   
    // setIO("input");
    int i,j,m=0,n,x;  
    f[0]=1;   
    scanf("%d",&n); 
    for(i=1;i<=n;++i) scanf("%d",&x),f^=(f<<x),m+=x;  
    int ans=0;
    for(i=1;i<=m;++i) if(f[i]) ans^=i; 
    printf("%d\n",ans); 
    return 0; 
}