# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
953116 |
2024-03-25T14:20:01 Z |
Pacybwoah |
양말 찾기 (KPI13_socks) |
C++17 |
|
1 ms |
348 KB |
#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]?arr[i][0]:arr[i][1])<<" "<<(arr[i][1]>arr[i][0]?arr[i][1]:arr[i][0])<<"\n";
return 0;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |