1061. Dating (20)

注意最后分钟的判定是大小字母

#include<iostream>#include<algorithm>#include<vector>#include<map> #include<string>#include<set>#include<stack> #include<queue>using namespace std;string Day(char a){	switch(a){		case 'A':return "MON";break;		case 'B':return "TUE";break;		case 'C':return "WED";break;		case 'D':return "THU";break;		case 'E':return "FRI";break;		case 'F':return "SAT";break;		case 'G':return "SUN";break;		default:return 0;break; 	}}int Hour(char a){	if(a <= '9' && a >= '0'){		return a - '0';	}	else{		return a - 'A' + 10;	}} int main(){	string s1, s2, s3, s4;	cin>>s1>>s2>>s3>>s4;	int flag = 0;	for(int i = 0; i < s1.size() && i < s2.size(); i++){		if(s1[i] >= 'A' && s1[i] <= 'G' && s1[i] == s2[i] && flag == 0){			cout<<Day(s1[i])<<" ";			flag = 1;			i++;			}		if(((s1[i] >= '0' && s1[i] <= '9') || (s1[i] >= 'A' && s1[i] <= 'N') )&& s1[i] == s2[i] && flag == 1){			PRintf("%02d:",Hour(s1[i]));			break;		}	}	for(int i = 0; i < s3.size() && i < s4.size(); i++){		if(s3[i] == s4[i] && ((s3[i] >= 'a' && s3[i] <= 'z') ||(s3[i] >= 'A' && s3[i] <= 'Z'))){			printf("%02d",i);			break;		}	}	return 0;}