PID15738
CID6162
进制友谊赛 WA20
#include<bits/stdc++.h>
using namespace std;
int main(){
string Q,B,O,H;
int D,q,b,o,h;
cin>>Q>>D>>B>>O>>H;
for(int i=0;i<Q.length();i++)q+=(Q[Q.length()-i-1]-'0')*(1<<(i*2));
for(int i=0;i<B.length();i++)b+=(B[B.length()-i-1]-'0')*(1<<i);
for(int i=0;i<O.length();i++)o+=(O[O.length()-i-1]-'0')*(1<<(i*3));
for(int i=0;i<H.length();i++){
if(H[H.length()-i-1]<='9')h+=(H[H.length()-i-1]-'0')*(1<<(i*4));
else h+=(H[H.length()-i-1]-'A'+10)*(1<<(i*4));
}
vector<pair<int,int>>v;
v.push_back({0,q});
v.push_back({1,D});
v.push_back({2,b});
v.push_back({3,o});
v.push_back({4,h});
sort(v.begin(),v.end(),[](pair<int,int>&a,pair<int,int>&b){
return a.second>b.second;
});
int dsgdgqw=0,sddfg=INT_MIN,ok=0;
for(int i=0;i<5;i++){
if(v[i].second!=sddfg){
sddfg=v[i].second;
dsgdgqw++;
}
if(v[i].first==0)ok=1;
}
if(ok)cout<<"Welcome!"<<endl;
else cout<<"Sorry."<<endl;
for(int i=0;i<5;i++){
switch(v[i].first){
case 0:cout<<Q<<" ";break;
case 1:cout<<D<<" ";break;
case 2:cout<<B<<" ";break;
case 3:cout<<O<<" ";break;
case 4:cout<<H<<" ";break;
}
}
}