# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
518291 | 2022-01-23T10:33:36 Z | lucri | XOR Sum (info1cup17_xorsum) | C++17 | 0 ms | 0 KB |
#include <iostream> using namespace std; long long n,x,ans; bool f[1000010]; int main() { cin>>n; for(int i=1;i<=n;++i) { cin>>x; ++f[x]; if(f[x]==false) f[x]=true; else { f[x]=false; ans=ans^(x+x); } } for(int i=1;i<=1000000;++i) if(f[i]==true) for(int j=i;j<=1000000;++j) { if(f[j]==true) ans=ans^(i+j); } cout<<ans; return 0; }