제출 #646393

#제출 시각아이디문제언어결과실행 시간메모리
646393murad_2005XOR Sum (info1cup17_xorsum)C++14
7 / 100
1670 ms8020 KiB
#include<bits/stdc++.h> #define ll long long #define ld long double #define ull unsigned long long #define ui unsigned int #define eb emplace_back #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define pb push_back #define pf push_front #define pii pair<int, int> #define pil pair<int, ll> #define plli pair<long long, int> #define pdi pair<double, int> #define pldldi pair<ld, pair<ld, int>> #define pdd pair<double, double> #define pid pair<int, double> #define piii pair<int, pair<int, int>> #define pllll pair<long long, long long> #define pllllll pair<ll, pllll> #define INF 2e9 + 5 #define size(v) v.size() #define f first #define s second #define Pi 3.14159265359 using namespace std; void solve(){ int n; cin >> n; ll Res = 0; vector<ll>a(n); for(int i = 0; i < n; i++){ cin >> a[i]; for(int j = 0; j <= i; j++){ Res ^= (a[i] + a[j]); } } cout << Res; } int main(){ int t; t = 1; // cin >> t; while(t--){ solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...