#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;
}
a = 0, b = x;
for (l = 0; l < L; l++)
if (xx[l] != 0 && xx[l] != x) {
a = xx[l], b = x ^ xx[l];
break;
}
if (a > b)
tmp = a, a = b, b = tmp;
printf("%d %d\n", a, b);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |