题目链接

bzoj3687: 简单题

题解

子集的和的异或和。
f[i]表示和为i的出现的次数
bitset优化一下背包

代码

#include<cstdio> 
#include<bitset> 
#include<cstring> 
#include<algorithm> 
#define LL long long 
#define gc getchar() 
#define pc putchar
inline int read() { 
    int x = 0,f = 1; 
    char c = gc; 
    while(c < '0' || c > '9' )c = gc; 
    while(c <= '9' && c >= '0') x = x * 10 + c - '0',c = gc; 
    return x * f ;
} 
void print(int x) {
     if(x >= 10) print(x / 10); 
     pc(x % 10 + '0'); 
} 
int n; 
const int maxn = 2000000; 
std::bitset<maxn>s; 
int main() { 
    n = read(); 
    s[0] = 1; 
    int sum = 0; 
    for(int a,i = 1;i <= n;++ i) { 
        a = read(); 
        sum += a; 
        s ^= (s << a);    
    } 
    int ans = 0; 
    for(int i = 1;i <= sum;++ i) 
        if(s[i]) ans ^= i; 
    print(ans); 
    return 0; 
} 

bzoj 3687: 简单题 bitset

原文：https://www.cnblogs.com/sssy/p/9769405.html