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>
#define ll long long
#define sz size()
#define pb push_back
#define all(x) x.begin() , x.end()
using namespace std;
int main()
{
ll n; cin >> n ; ll a[n] ;
map<int,int> mp ;ll mx = -1 ;
for (int i = 0; i < n; i++)
{
cin >> a[i]; mp[a[i]] ++ ;
mx = max(mx , a[i] );
}
for(auto &it: mp ){
it.second%=2 ;
}
ll ans = 0 ;
for(int i = 0 ; i < 4005 ; i ++ ){
for (int j = 0; j < 4005 ; j ++)
{
ans ^= (mp[j]*j + mp[i]*i) ;
}
}
cout<<ans<<endl;
return 0;
}
# | 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... |