Language: C++


//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <limits>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x * x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define EXISTch(s,c) ((((s).find_first_of(c)) != std::string::npos)? 1 : 0)//cがあれば1 if(1)
#define SORT(c) sort((c).begin(),(c).end())

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007;//10^9+7
const LL INF2 = (LL)100000000000000000;//10^18

int main() {

	int n; cin >> n;
	vector<int> a(n);

	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}

	vector<int> b(n);

	for (int i = 0; i < n; i++) {
		cin >> b[i];
	}

	int ans = 0;

	for (int bit = 0; bit <= 29; bit++) {

		vector<int> c(n);
		vector<int> d(n);

		for (int i = 0; i < n; i++) {
			c[i] = a[i] % (1 << (bit + 1));
			d[i] = b[i] % (1 << (bit + 1));
		}

		sort(d.begin(), d.end());

		int T = (1 << bit);

		int sum = 0;

		for (int i = 0; i < n; i++) {

			if (T - c[i] >= 0) {
				sum += lower_bound(d.begin(), d.end(), 2 * T - c[i])- lower_bound(d.begin(), d.end(), T - c[i])
			}
			else {

				sum += lower_bound(d.begin(), d.end(), 2*T - c[i]) - d.begin();
				sum += lower_bound(d.begin(), d.end(), 2 * T) - lower_bound(d.begin(), d.end(), 2 * T + T - c[i]);
			}


		}

		if (sum % 2 == 1) {
			ans += (1 << bit);
		}
	}

	cout << ans << endl;

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:107:128: error: expected ';' before '}' token
  107 |                                 sum += lower_bound(d.begin(), d.end(), 2 * T - c[i])- lower_bound(d.begin(), d.end(), T - c[i])
      |                                                                                                                                ^
      |                                                                                                                                ;
  108 |                         }
      |                         ~