제출 #1158216

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1158216		itaykarny	XOR Sum (info1cup17_xorsum)	C++20	0 / 100	63 ms	8260 KiB

xorsum

#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<string>
#include<math.h>



using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pair<ll, ll>>;
using vvpll = vector<vpll>;


int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	ll n;
	cin >> n;
	vll arr(n);
	for (ll i = 0; i < n; i++) cin >> arr[i];
	ll ans = 0;
	for (ll b = 0; b < 30; b++) {
		ll res = 0;
		ll carry = (ll)1 << b;
		for (ll i = 0; i < n; i++) {
			if (((arr[i] * 2) >> b) & 1) { res++; }
		}
		ans += (res % 2) * carry;
	}
	cout << ans << endl;
}

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