PAT 1014 福尔摩斯的约会

PAT 1014 福尔摩斯的约会

思路：
按题意进行模拟

#include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define N 100
char a1[N],a2[N];
char s1[N],s2[N];
char m[7][5] = {"MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN"};
int main(void){
    scanf("%s %s %s %s",a1,a2,s1,s2);
    int l1=strlen(a1),l2=strlen(a2);
    int flag=0;
    for(int i=0;i<l1&&l2;i++){
        if(flag&&a1[i]==a2[i]){
            if(a1[i]>='0'&&a1[i]<='9'){
                printf("%02d",a1[i]-'0');
                break;
            }else if(a1[i]>='A'&&a1[i]<='N'){
                printf("%02d",a1[i]-'A'+10);
                break;
            }
        }else if(a1[i]>='A'&&a1[i]<='G'&&a1[i]&&a1[i]==a2[i]){
            flag=1;
            printf("%s ",m[a1[i]-'A']);
        }
    }
    int ls=strlen(s1);
    for(int i=0;i<ls;i++){
        if(isalpha(s1[i])&&s1[i]==s2[i]){
            printf(":%02d",i);
            break;
        }
    }
    return 0;
}