PTA甲级 1061 Dating (C++)

Sherlock Holmes received a note with some strange strings: Let's date! 3485djDkxh4hhGE 2984akDfkkkkggEdsb s&hgsfdk d&Hyscvnm. It took him only a minute to figure out that those strange strings are actually referring to the coded time Thursday 14:04 – since the first common capital English letter (case sensitive) shared by the first two strings is the 4th capital letter D, representing the 4th day in a week; the second common character is the 5th capital letter E, representing the 14th hour (hence the hours from 0 to 23 in a day are represented by the numbers from 0 to 9 and the capital letters from A to N, respectively); and the English letter shared by the last two strings is s at the 4th position, representing the 4th minute. Now given two pairs of strings, you are supposed to help Sherlock decode the dating time.

Input Specification:

Each input file contains one test case. Each case gives 4 non-empty strings of no more than 60 characters without white space in 4 lines.

Output Specification:

For each test case, print the decoded time in one line, in the format DAY HH:MM, where DAY is a 3-character abbreviation for the days in a week – that is, MON for Monday, TUE for Tuesday, WED for Wednesday, THU for Thursday, FRI for Friday, SAT for Saturday, and SUN for Sunday. It is guaranteed that the result is unique for each case.

Sample Input:

3485djDkxh4hhGE 
2984akDfkkkkggEdsb 
s&hgsfdk 
d&Hyscvnm

Sample Output:

THU 14:04

Caution:

这个题的描述有问题！
这个题的描述有问题！
这个题的描述有问题！

对于小时的解释有问题，题目里面说：

the second common character is the 5th capital letter E…

我没翻译错的话就是

第二个共同的字符是第五个大写字母E…

但显然不是啊！！！！
大家看样例输入，第一个字符串和第二个字符串的第二个共同的字符明明是D（和星期四那个同一个D），而第一个是位于第二个位置（从零开始计数）的8，因为题目里明确说明是第二个相同的“字符”，所以数字和字母都应该算的。

所以我觉得这个题他自己都没说明白规则。。。。。

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-19 17:45:01
// All rights reserved.

#include <iostream>
#include <vector>

using namespace std;

string days[7] = {"MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN"};

int main(){
    string a, b, c, d;
    cin >> a >> b >> c >> d;

    int day, hour, minute;
    
    day = 0;
    while(true){
        if(a[day] == b[day] && 'A' <= a[day] && 'G' >= a[day]) break;
        day++;
    }

    hour = day + 1;
    while(true){
        if(a[hour] == b[hour] && (isdigit(a[hour]) || (a[hour] >= 'A' && a[hour] <= 'N'))) break;
        hour++;
    }

    minute = 0;
    while(true){
        if(c[minute] == d[minute] && isalpha(c[minute])) break;
        minute++;
    }

    printf("%s %02d:%02d\n", days[a[day] - 'A'].c_str(), a[hour] <= '9' ? a[hour] - '0' : a[hour] - 'A' + 10, minute);

    return 0; 
}