| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 12777 | gs13068 | 양말 찾기 (KPI13_socks) | C++98 | 1944 ms | 1600 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<cstdio>
int d[2][65536];
int main()
{
    int i,n,a,b;
    scanf("%d",&n);
    while(n--)
	{
		scanf("%d",&i);
		i+=1000000001;
        d[0][i>>16]^=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-1000000001,b-1000000001);
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
