题解
诶,补题补题
结论题
官方题解:
代码学习来源 - 大佬博客
第k位上要想有1,必须有奇数个的第k位为1的 a i + a j a_i+a_j ai+aj ,
高于k位的位置不会对第k为产生影响,所以可以 mod 2 k + 1 2^{k+1} 2k+1 去掉高位,
只有当 a i + a j a_i+a_j ai+aj 处于 [ 2 k , 2 k + 1 ) ∪ [ 2 k + 1 + 2 k , 2 k + 2 − 2 ] [2^k,2^{k+1})∪[2^{k+1}+2^k,2^{k+2}-2] [2k,2k+1)∪[2k+1+2k,2k+2−2] 时,第k位才为1,
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10;
int a[N], b[N];
int n, m, K;
int main() {
ios::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
int ans = 0;
for (int k = 0; k <= 26; ++k) {
int mod = 1 << (k + 1);
for (int i = 1; i <= n; ++i) {
b[i] = a[i] % mod;
}
int tmp = 0;
sort(b + 1, b + 1 + n);
for (int i = 1; i <= n; ++i) {
int l, r;
l = lower_bound(b + 1, b + 1 + n, (1 << k) - b[i]) - b;
r = lower_bound(b + 1, b + 1 + n, (1 << (k + 1)) - b[i]) - b - 1;//右区间应该在 2^k-b[i]的左边
tmp += r - l + 1;
l = lower_bound(b + 1, b + 1 + n, (1 << (k + 1)) + (1 << k) - b[i]) - b;
r = lower_bound(b + 1, b + 1 + n, (1 << (k + 2)) - 1 - b[i]) - b - 1;
tmp += r - l + 1;
if ((b[i] + b[i]) & (1 << k)) {//自己加自己不算
tmp--;
}
}
if ((tmp / 2) & 1)//a[i]+a[j]算了两次 所以要除2
ans += 1 << k;
}
cout << ans << endl;
return 0;
}