PAT甲级 1061 Dating (20 分)

最新推荐文章于 2025-08-31 12:34:04 发布

原创最新推荐文章于 2025-08-31 12:34:04 发布 · 161 阅读

0 ·

CC 4.0 BY-SA版权

PAT甲级专栏收录该内容

79 篇文章

订阅专栏

这篇博客介绍了如何解析由福尔摩斯收到的一系列看似无意义的字符串，这些字符串实际上是隐藏的约会时间代码。通过找出字符串之间的共同大写英文字母，解码出了星期、小时和分钟。文章详细阐述了解码过程，并给出了样例输入和输出，展示了解码方法的正确性和独特性。

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

#include <iostream>
#include <unordered_map>
#include <cstdio>

using namespace std;
string week[8] = {" ", "MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN"};

int main() {
    string s[4];
    for (int i = 0; i < 4; ++i) {
        cin >> s[i];
    }
    int minAB = min(s[0].size(), s[1].size());
    int minCD = min(s[2].size(), s[3].size());
    bool first_common = false;
    for (int i = 0; i < minAB; ++i) {
        if (!first_common and s[0][i] == s[1][i] and s[0][i] >= 'A' and s[0][i] <= 'G') {
            cout << week[s[0][i] - 'A' + 1] << " ";
            first_common = true;
        } else if (first_common and s[0][i] == s[1][i]) {
            if (s[0][i] >= 'A' and s[0][i] <= 'N') {
                printf("%02d:", s[0][i] - 'A' + 10);
                break;
            } else if (isdigit(s[0][i])) {
                printf("%02d:", s[0][i] - '0');
                break;
            }
        }
    }
    for (int i = 0; i < minCD; ++i) {
        if (s[2][i] == s[3][i] and isalpha(s[2][i]))
            printf("%02d", i);
    }
    return 0;
}

#include <iostream>
#include <unordered_map>
#include <cstdio>

using namespace std;
string week[8] = {" ", "MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN"};

int main() {
    string s[4];
    for (int i = 0; i < 4; ++i) {
        cin >> s[i];
    }
    int k = 0;
    while (true) {
        if (s[0][k] == s[1][k] and s[0][k] >= 'A' and s[0][k] <= 'G') {
            cout << week[s[0][k] - 'A' + 1] << " ";
            k++;
            break;
        }
        k++;
    }
    while (true) {
        if (s[0][k] == s[1][k]) {
            if (s[0][k] >= 'A' and s[0][k] <= 'N') {
                printf("%02d:", s[0][k] - 'A' + 10);
                k++;
                break;
            } else if (isdigit(s[0][k])) {
                printf("%02d:", s[0][k] - '0');
                k++;
                break;
            }
        }
        k++;
    }
    for (int i = 0;; i++) {
        if (s[2][i] == s[3][i] and isalpha(s[2][i])) {
            printf("%02d", i);
            break;
        }
    }
    return 0;
}