求讲解这份代码的思路

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int n,k,cz=N,ans;
int a[N],b[N];
int main(){
	freopen("xor4.in","r",stdin);
	freopen("xor.out","w",stdout);
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		b[i]=b[i-1]^a[i];
	}
	for(int i=1;i<=n;i++){
		for(int j=i;j<=n;j++){
			if((b[j]^b[i-1])==k){
				if(j<cz){
					if(cz==N) ans++;
					cz=j;
					break;
				}
				else if(i<=cz&&j>=cz) break;
				else{
					ans++;
					cz=j;
//					i=cz;
					break;
				}
			}
		}
	}
	cout<<ans;
}