Submission #12774

#TimeUsernameProblemLanguageResultExecution timeMemory
12774gs13068양말 찾기 (KPI13_socks)C++98
0 / 1
0 ms1600 KiB
#include<cstdio> int d[2][65536]; int main() { int i,n,a,b; scanf("%d",&n); while(n--) { scanf("%d",&i); d[0][i>>8]^=i; d[1][i&65535]^=i; } a=b=0; for(i=0;i<65536;i++)if(d[0][i]) { if(a)b=d[0][i]; else a=d[0][i]; } if(!b) { a=b=0; for(i=0;i<65536;i++)if(d[1][i]) { if(a)b=d[1][i]; else a=d[1][i]; } } if(a>b)a^=b^=a^=b; printf("%d %d",a,b); }
#Verdict Execution timeMemoryGrader output
Fetching results...