1061. Dating (20)

按说明探寻，注意第一个日期 A-G第二个时 0-9和A-N 第三个分 a-z和A-Z

#include<iostream>
#include<string>
using namespace std;
string week[7] = { "MON","TUE","WED","THU","FRI","SAT","SUN" };
int main()
{
    string a, b, c, d;
    cin >> a >> b >> c >> d;
    int min = a.length() < b.length() ? a.length() : b.length();
    int count = 0;
    for (int t = 0;t < min;t++)
    {
        if (count == 0)//首先寻找日期
        {
            if (a[t] >= 'A' && a[t] <= 'G' && a[t] == b[t])
            {
                count++;
                cout << week[a[t] - 'A'] << " ";
            }
        }
        else//其次寻找时
        {
            if (((a[t] >= '0'&&a[t] <= '9') || (a[t] >= 'A'&&a[t] <= 'N')) && a[t] == b[t])
            {
                printf("%02d:", a[t] < 'A' ? a[t] - '0' : a[t] - 'A' + 10);
                break;
            }
        }
    }
    min = c.length() < d.length() ? c.length() : d.length();
    for (int t = 0;t < min;t++)//最后寻找分
    {
        if (((c[t] >= 'a'&&c[t] <= 'z') || (c[t] >= 'A'&&c[t] <= 'Z')) && c[t] == d[t])
        {
            printf("%02d\n", t);break;
        }
    }
}