Solution

```c

```

Solution

#include <bits/stdc++.h>
using namespace std;
 
int main(){
  int n;
  cin >> n;
  int v[n];
  for(int i = 0; i < n; i++) cin >> v[i];
 
  int prefix[n+1][30];
  for(int i = 0; i < 30; i++) prefix[0][i] = 0;
 
  for(int i = 0; i < n; i++){
    for(int j = 0; j < 30; j++){
      prefix[i+1][j] = prefix[i][j];
      prefix[i+1][j] += ((v[i] >> j) & 1); 
    }
  }
 
  int q;
  cin >> q;
  int ans[n] = {0};
  while(q--){
    int l, r;
    cin >> l >> r;
    int result = 0;
    for(int i = 0; i < 30; i++){
      if(prefix[r][i] - prefix[l-1][i] == r - l + 1){
        result |= (1 << i);
      }
    }
 
    ans[l-1] ^= result;
    if(r != n)
    ans[r] ^= result;
  }
 
  for(int i = 1; i < n; i++){
    ans[i] ^= ans[i-1];
  }
 
  for(int i = 0; i < n; i++){
      ans[i] ^= v[i];
    cout << ans[i] << " ";
  }
  cout << "\n";
 
}

Solution

```c

```