제출 #1149287

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1149287		gazizmadi11	XOR Sum (info1cup17_xorsum)	C++20	7 / 100	1694 ms	8004 KiB

xorsum

//gm  --- akezhon
#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define tm (tl+tr)/2
#define TL v+v, tl, tm
#define TR v+v+1, tm+1, tr
#define DA l <= tl && tr <= r
#define NE r < tl || tr < l
#define double long double
#define int long long
using namespace std;

const int N=3e5+7;
const int mod=1e9+7;
const int inf=2e18;

void AlemAmenov(){
	int ans=0;
	int cnt[30]{};
	int n;
	cin >> n;
	int a[n+1];
	for(int x, i=1; i <= n; i++){
		cin >> a[i];
	}
	for(int i=1; i <= n; i++){
		for(int j=i; j <= n; j++){
			ans ^= (a[i]+a[j]);
		}
	}
	cout << ans;
}
signed main(){

	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int RealName=1;
	// cin >> RealNam;
	// srand(time(0));

	while(RealName--)
		AlemAmenov();
	
return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 21
• Subtask 4: 0 / 38
• Subtask 5: 0 / 23