#include<iostream>
using namespace std;
void weekprint(char n){
if (n == 'A'){
cout << "MON ";
}else if (n == 'B'){
cout << "TUE ";
}else if (n == 'C'){
cout << "WED ";
}else if (n == 'D'){
cout << "THU ";
}else if (n == 'E'){
cout << "FRI ";
}else if (n == 'F'){
cout << "SAT ";
}else if (n == 'G'){
cout << "SUN ";
}
return ;
}
int main () {
string s1, s2, s3, s4;
cin >> s1 >> s2 >> s3 >> s4;
int len1 = min(s1.length(), s2.length());
int len2 = min(s3.length(), s4.length());
int i, j;
for (i = 0; i < len1; i++){
if (s1[i] == s2[i] && (s1[i] >= 'A' && s1[i] <= 'G')){
weekprint(s1[i]);
j = i + 1;
break;
}
}
for (;j < len1; j++){
if (s1[j] == s2[j] && ((s1[j] >= 'A' && s1[j] <= 'N') || isdigit(s1[j]))){
if (isdigit(s1[j])){
cout << "0" << s1[j] << ":";
// printf("%02d:", s1[j]);
}else{
cout << s1[j] - 'A' + 10 << ":";
}
break;
}
}
for (int k = 0; k < len2; k++){
if (s3[k] == s4[k] && isalpha(s3[k])){
printf("%02d", k);
break;
}
}
return 0;
}
PAT/1014 福尔摩斯的约会
于 2023-10-23 19:40:24 首次发布
这篇文章描述了一个C++程序,通过输入的两个字符串中的字符进行比较,输出第一个字符串中匹配到的星期几和对应的时间段。
摘要由CSDN通过智能技术生成