# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
953489 | Pacybwoah | 양말 찾기 (KPI13_socks) | C++17 | 2245 ms | 65536 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <set>
using namespace std;
int n,v[31];
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x; scanf("%d", &x);
x += 1000000001;
for (int j = 0; j < 31; j++) if (x & (1 << j)) v[j] ^= x;
}
set<int> ans; int u = 0;
for (int j = 0; j < 31; j++) {
if (v[j] & (1 << j)) ans.insert(v[j]);
else if (v[j]) u = v[j];
}
if (ans.size() == 1) ans.insert(u^*ans.begin());
for (auto &x : ans) printf("%d ", x - 1000000001);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |