求给一组hack

#include<bits/stdc++.h>
using namespace std;
int a[500005];
int b[500005];
int main () {
    int n,k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
        cin >> a[i];
        b[i] = a[i];
        b[i] ^= b[i-1];
    }
    int cnt = 0;
    int now = b[0];
    now ^= k;
    for (int i = 1; i <= n; i++) {
        bool find = 0;
        for (int j = i; j <= n; j++) {
            if (b[j] == now) {
                cnt++;
                now = b[j] ^ k;
                i = j;
                find = 1;
                break;
            }
        }
        if (find == 1) {
            continue;
        }
        now = b[i] ^ k;
    }
    cout << cnt << endl;
	return 0;
}