| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 5087 |
2014-02-02T21:29:16 Z |
ainta |
양말 찾기 (KPI13_socks) |
C++ |
|
0 ms |
1440 KB |
#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 time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1440 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1440 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1440 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1440 KB |
Output is correct |
| 5 |
Incorrect |
0 ms |
1440 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
