# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67694 | tatatan | XOR Sum (info1cup17_xorsum) | C++11 | 1675 ms | 8320 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 <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;
const int MAXN=1000005;
LL n,a[MAXN],b[MAXN];
LL ans;
int main() {
scanf("%lld",&n);
for(int i=0;i<n;++i)
scanf("%lld",&a[i]);
LL ans2=0;
for(int i=0;i<n;++i)
for(int j=i;j<n;++j)
ans2^=a[i]+a[j];
printf("%lld\n",ans2);
}
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... |