#include<bits/stdc++.h>
using namespace std;
map<char,int>mp;
int main(){
char a[8][8]={"MON","TUE","WED","THU","FRI","SAT","SUN"};
for(int i=0;i<=13;i++){
mp['A'+i]=10+i;
}
// for(int i=0;i<=7;i++){
// printf("%s",a[i]);
// }
// for(int i=0;i<=13;i++){
// cout<<mp['A'+i]<<" ";
// }
int day;
int h=0,m=0;
string str1,str2,str3,str4;
cin>>str1>>str2>>str3>>str4;
int k=min(str1.size(),str2.size());
int flag=0; //0123456 78910 11 12 13
for(int i=0;i<k;i++){//ABCDEFG HIJKLMN
if(flag==1&&(str1[i]>='A'&&str1[i]<='N'||str1[i]>='0'&&str1[i]<='9')&&str1[i]==str2[i]){
if(str1[i]>='A'&&str1[i]<='N'){
h=mp[str1[i]];
}else{
h=str1[i]-'0';
}
//cout<<"h="<<h<<endl;
//cout<<mp[str1[i]]<<endl;
break;
}
if(flag==0&&str1[i]>='A'&&str1[i]<='G'&&str1[i]==str2[i]){
//day=(str1[i]-'A')-'0';
day=mp[str1[i]]-10;
// cout<<day<<endl;
// cout<<str1[i];
flag=1;
}
}
k=min(str3.size(),str4.size());
for(int i=0;i<k;i++){
if((str3[i]>='a'&&str4[i]<='z'||str3[i]>='A'&&str4[i]<='Z')&&str3[i]==str4[i]){
m=i;
break;
}
}
//cout<<day;
printf("%s ",a[day]);
if(h<10){
cout<<"0"<<h<<":";
}else{
cout<<h<<":";
}
if(m<10){
cout<<"0"<<m;
}else{
cout<<m;
}
//A9
//A9
//ASAasdxzcs
//asadasdzdsa
}
1014 福尔摩斯的约会
最新推荐文章于 2024-08-09 20:36:57 发布