Xor sum

#include <bits/stdc++.h>
using namespace std;

const int NMX = (int)2e5+1;

int main() {
	int ar[NMX];
	
	int n, q;
	cin >> n >> q;
	
	ar[0] = 0;
	for (int i=0; i<n; i++) {
		int b;
		cin >> b;
		ar[i+1] = ar[i] ^ b;
	}

	for (int i=0; i<q; i++) {
		int a, b;
		cin >> a >> b;
		int out = ar[a-1] ^ ar[b];
		cout << out << '\n'; 
	}
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED