0
点赞
收藏
分享

微信扫一扫

1014 福尔摩斯的约会 (20 分)

白衣蓝剑冰魄 2022-02-04 阅读 47
c++
#include<iostream>
#include<algorithm>
#include<cctype>
using namespace std;
int main(){
	string time="0123456789ABCDEFGHIJKLMN";
	string day[7]={"MON","TUE","WED","THU","FRI","SAT","SUN"};
	string s,t,x,y;
	int f=1;
	getline(cin,s);
    getline(cin,t);
	getline(cin,x);
    getline(cin,y);
	for(int i=0;i<min(s.length(),t.length());i++){
			if(s[i]==t[i]&&f&&(s[i]-'A'<7&&s[i]-'A'>=0)){
				cout<<day[(int)(s[i]-'A')]<<' ';
				f=0;
			}else if(s[i]==t[i]&&f==0&&time.find(s[i])!=string::npos){
                printf("%02d:",time.find(s[i]));
                break;
            }
	}
	for(int i=0;i<min(x.length(),y.length());i++){
		if(x[i]==y[i]&&isalpha(x[i])){
			printf("%02d",i);
			break;
		}
	}
    return 0;
}

 

举报

相关推荐

0 条评论