Submission #5087

#TimeUsernameProblemLanguageResultExecution timeMemory
5087ainta양말 찾기 (KPI13_socks)C++98
0 / 1
0 ms1440 KiB
#include<stdio.h> int b[2][45010], r[2]; int main(){ int n, a, i, j, c = 0; scanf("%d", &n); while (n--){ scanf("%d", &a); a += 1000000000; b[0][a % 45001] ^= a, b[1][a % 45000] ^= a; } for (i = 0; i<2 && c != 2; i++){ c = 0; for (j = 0; j<45001; j++)if (b[i][j]) r[c++] = b[i][j] - 1000000000; } if (r[0]>r[1])a = r[0], r[0] = r[1], r[1] = a; printf("%d %d\n", r[0], r[1]); }
#Verdict Execution timeMemoryGrader output
Fetching results...