XOR 异或的性质与可差分性

1
void solve() {
2
    int n;
3
    cin >> n;
4
    vector<ll> v(n), pa(n);
5
    for (int i = 0; i < n; i++) {
6
        cin >> v[i];
7
    }
8

9
    pa[0] = v[0];
10
    for (int i = 1; i < n; i++) {
11
        pa[i] = pa[i - 1] ^ v[i];
12
    }
13

14
    if (pa[n - 1] == 0) {
15
        YES;
16
        return;
17
    }
18

19
    for (int i = 0; i < n - 1; i++) {
20
        for (int j = i + 1; j < n - 1; j++) {
21
            ll a = pa[i];
22
            ll b = pa[j] ^ pa[i];
23
            ll c = pa[n - 1] ^ pa[j];
24
            if (a == b && b == c) {
25
                YES;
26
                return;
27
            }
28
        }
29
    }
30

31
    NO;
32
}