题解 | Poi 的新加法（Easy Version）

#include <iostream>
#include<vector>
using namespace std;

int main() {
    int T;
    cin >> T;
    while (T--) {
        int n, q;
        cin >> n >> q;
        vector<long long>a(n);
        for (int i = 0; i < n; i++)
            cin >> a[i];
        while(q--) {
            int l, r;
            cin >> l >> r;
            long long sum = a[l - 1];
            for (int i = l; i < r; i++)
                sum = (a[i] + sum - long(a[i] ^ sum));
            cout << sum << endl;
        }
    }
}
// 64 位输出请用 printf("%lld")