Submission #521806

#TimeUsernameProblemLanguageResultExecution timeMemory
521806maks007XOR Sum (info1cup17_xorsum)C++14
0 / 100
1683 ms8268 KiB
#include <bits/stdc++.h>
 
using namespace std;
 
int main(void) {
	int n;
	cin>> n;
	vector <int> a(n);
	vector <int> idx((int)1e6, 0);
	for(int i = 0; i < n; i ++ ) {
		cin >> a[i];
		idx[a[i]] ++;
	}
	sort(a.begin(), a.end());
	a.erase(unique(a.begin(), a.end()), a.end());
	int ans = 0;
	for(int i = 0; i < n; i ++) {
		for(int j = i; j < n; j ++) {
			if(idx[a[j]] % 2 == 1)
				ans ^= (a[i] + a[j]);
			else continue;
		}
	}
	cout << ans;
	return false;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...