| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 953115 | Pacybwoah | 양말 찾기 (KPI13_socks) | C++17 | 0 ms | 348 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<iostream>
using namespace std;
int arr[32][2];
int main(){
    int n;
    cin>>n;
    int x;
    for(int i=0;i<32;i++) arr[i][0]=0,arr[i][1]=0;
    int j;
    for(int i=0;i<n;i++){
        cin>>x;
        for(j=31;j>=0;j--){
            if(x&(1<<j)) arr[j][1]^=x;
            else arr[j][0]^=x;
        }
    }
    for(int i=0;i<32;i++){
        if(arr[i][0]>0&&arr[i][1]>0){
            cout<<arr[i][0]<<" "<<arr[i][1]<<"\n";
            return 0;
        }
    }
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
