PAT - 1014 福尔摩斯的约会

题目链接：点击打开链接

 

题目大意：略。

 

解题思路：略。

 

AC代码

#include<bits/stdc++.h>
#include<cmath>

#define mem(a,b) memset(a,b,sizeof a);
#define INF 0x3f3f3f3f

using namespace std;

typedef long long ll;

int main()
{
    string a,b,c,d,week[7]={"MON","TUE","WED","THU","FRI","SAT","SUN"};
    cin>>a>>b>>c>>d;
    int i=0,j=0,sum;
    char rnt[2];
    while(i<a.length()&&i<b.length())
    {
        if(a[i]==b[i]&&(a[i]>='A'&&a[i]<='G'))
        {
            rnt[0]=a[i];
            break;
        }
        i++;
    }
    i=i+1;
    while(i<a.length()&&i<b.length())
    {
        if(a[i]==b[i]&&((a[i]>='A'&&a[i]<='N')||isdigit(a[i])))
        {
            rnt[1]=a[i];
            break;
        }
        i++;
    }
    while(j<c.length()&&j<d.length())
    {
        if(c[j]==d[j]&&isalpha(c[j]))
        {
            sum=j;
            break;
        }
        j++;
    }
    cout<<week[rnt[0]-'A']<<" ";
    int hh=isdigit(rnt[1])? rnt[1]-'0':rnt[1]-'A'+10;
    printf("%02d:%02d",hh,sum);

    return 0;
}