# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67813 | 2018-08-15T10:18:52 Z | ege_eksi | XOR Sum (info1cup17_xorsum) | C++14 | 1600 ms | 8932 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 376 KB | Output is correct |
2 | Correct | 12 ms | 400 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1666 ms | 8932 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1666 ms | 8932 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 376 KB | Output is correct |
2 | Correct | 12 ms | 400 KB | Output is correct |
3 | Execution timed out | 1638 ms | 8932 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 376 KB | Output is correct |
2 | Correct | 12 ms | 400 KB | Output is correct |
3 | Execution timed out | 1666 ms | 8932 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |