Xor sum

#include <iostream>
using namespace std;

int main(){
    int n,m;
    cin >> n >> m;
    int xor_sum[n+1];
    xor_sum[0] = 0;
    for (int i = 1; i <= n; i++){
        int a;
        cin >> a;
        xor_sum[i] = xor_sum[i-1] ^ a;
    }
    int ans[m];
    for (int i = 0; i < m; i++){
        int l, r;
        cin >> l >> r;
        ans[i] = (xor_sum[r] ^ xor_sum[l-1]);
    }

    for (int i = 0; i < m; i++){
        cout << ans[i] << endl;
    }
    return 0;

}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED