Submission #360615

# Submission time Handle Problem Language Result Execution time Memory
360615 2021-01-28T05:16:28 Z tengiz05 XOR Sum (info1cup17_xorsum) C++17
7 / 100
1600 ms 4204 KB
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6+5;
int n;
int a[MAXN];
signed main(){
	cin >> n;
	for(int i=0;i<n;i++){
		cin >> a[i];
	}
	int ans = 0;
	for(int i=0;i<n;i++){
		for(int j=i;j<n;j++){
			ans ^= a[i] + a[j];
		}
	}cout << ans << '\n';
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 10 ms 364 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 1665 ms 4204 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1665 ms 4204 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 10 ms 364 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
3 Execution timed out 1697 ms 748 KB Time limit exceeded
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 10 ms 364 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
3 Execution timed out 1665 ms 4204 KB Time limit exceeded
4 Halted 0 ms 0 KB -