# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
949786 | rainboy | 양말 찾기 (KPI13_socks) | C11 | 1 ms | 348 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 <ctype.h>
#include <stdio.h>
#define L 31 /* L = ceil(log2(2 * 10^9 + 1)) */
int read() {
char c;
int a;
while (!isdigit(c = getchar()))
;
a = 0;
for ( ; isdigit(c); c = getchar())
a = a * 10 + c - '0';
return a;
}
int main() {
static int xx[L];
int n, l, a, b, x, tmp;
n = read();
x = 0;
while (n--) {
a = read();
x ^= a;
for (l = 0; l < L; l++)
if ((a & 1 << l) != 0)
xx[l] ^= a;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |