# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67813 | ege_eksi | XOR Sum (info1cup17_xorsum) | C++14 | 1666 ms | 8932 KiB |
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<iostream>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<algorithm>
using namespace std;
int *v;
int main()
{
int n;
scanf("%d",&n);
v = new int[n];
for(int i = 0 ; i < n ; i++)
{
scanf("%d",&v[i]);
}
long long int ans = 0;
int i , j;
for(i = 0 ; i < n ; i++)
{
for(j = i ; j < n ; j++)
{
ans = ans ^ (v[i] + v[j]);
}
}
printf("%lli",ans);
return 0;
}
Compilation message (stderr)
# | 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... |