This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |