Submission #360629

# Submission time Handle Problem Language Result Execution time Memory
360629 2021-01-28T05:22:27 Z tengiz05 XOR Sum (info1cup17_xorsum) C++17
45 / 100
718 ms 1772 KB
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const int MAXN = 1e5+5;
int n;
int a[MAXN];
signed main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);
	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 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 748 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 748 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 718 ms 748 KB Output is correct
4 Correct 641 ms 1772 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Incorrect 10 ms 748 KB Output isn't correct
4 Halted 0 ms 0 KB -