제출 #1302664

#제출 시각아이디문제언어결과실행 시간메모리
1302664yus1f_mXOR Sum (info1cup17_xorsum)C++20
45 / 100
1694 ms8600 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> #define ll long long #define str string #define pb push_back #define pf push_front #define in insert #define all(v) v.begin(),v.end() #define fastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); const int sz=1000001,INF=1000000000; using namespace std; void solve() { ll n,num,ans=0; cin>>n; vector<ll>nums; for(int i=0;i<n;i++) { cin>>num; nums.pb(num); } for(int i=0;i<nums.size();i++) { for(int j=i;j<nums.size();j++) { ans^=(nums[i]+nums[j]); } } cout<<ans; } int main() { fastIO; ll t=1; //cin>>t; while(t--) { solve(); } }
#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...