#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
const int maxn = 100001;
char day[10][5] =
{
"MON","TUE","WED","THU","FRI","SAT","SUN"
};
int main()
{
freopen("1.txt","r",stdin);
string s1,s2,s3,s4;
cin>>s1;
cin>>s2;
cin>>s3;
cin>>s4;
int ind;
for(int i = 0;i<s1.size() && s2.size();i++)
{
if(s2[i] == s1[i] && s1[i] >= 'A' && s1[i] <= 'G')
{
int t = s1[i] - 'A';
printf("%s ",day[t]);
ind = i + 1;
break;
}
}
for(int i = ind;i<s1.size() && i<s2.size();i++)
{
if(s2[i] == s1[i] && s1[i] >= '0' && s1[i] <= '9')
{
int t = s1[i] - '0';
printf("%02d:",t);
ind = i + 1;
break;
}
else if(s2[i] == s1[i] && s1[i] >= 'A' && s1[i] <= 'N')
{
int t = s1[i] - 'A' + 10;
printf("%02d:",t);
ind = i + 1;
break;
}
}
for(int i = 0;i<s3.size() && i<s4.size();i++)
{
if(s3[i] == s4[i] && s3[i] >= 'a' && s3[i] <= 'z')
{
int t = i;
printf("%02d",i);
break;
}
if(s3[i] == s4[i] && s3[i] >= 'A' && s3[i] <= 'Z')
{
int t = i;
printf("%02d",i);
break;
}
}
return 0;
}
1061 Dating (20分)
最新推荐文章于 2022-05-05 02:03:10 发布