| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 949810 | rainboy | 양말 찾기 (KPI13_socks) | C++17 | 1701 ms | 51364 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>
#define L	31	/* L = ceil(log2(2 * 10^9 + 1)) */
int main() {
	static int xx[L];
	int n, l, a, b, x, sgn, tmp;
	char c;
	while (1) {
		c = getchar();
		if (c >= '0' && c <= '9' || c == '-')
			break;
	}
	sgn = 1;
	if (c == '-')
		sgn = -1, c = getchar();
	n = 0;
	for ( ; c >= '0' && c <= '9'; c = getchar())
		n = n * 10 + c - '0';
	n *= sgn;
	x = 0;
	while (n--) {
		while (1) {
			c = getchar();
			if (c >= '0' && c <= '9' || c == '-')
				break;
		}
		sgn = 1;
		if (c == '-')
			sgn = -1, c = getchar();
		a = 0;
		for ( ; c >= '0' && c <= '9'; c = getchar())
			a = a * 10 + c - '0';
		a *= sgn;
		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;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
