PAT-A1061 Dating (20)（模拟）

注意前两个不是从A-Z，是A-G和A-N。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
using namespace std;

#define MAX 60+5
char week[7][5] = {"MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN"};

int main()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    char str1[MAX], str2[MAX], str3[MAX], str4[MAX];
    char time[2];
    int i = 0, shi = 0, fen = 0;
    gets(str1);
    gets(str2);
    gets(str3);
    gets(str4);
    for (i = 0; i < strlen(str1) && i < strlen(str2); i++)
    {
        if (str1[i] >= 'A' && str1[i] <= 'G' && str1[i] == str2[i])
        {
            time[0] = str1[i];
            break;
        }
    }

    for (i++; i < strlen(str1) && i < strlen(str2); i++)
    {
        if ((str1[i] >= 'A' && str1[i] <= 'N') || (str1[i] >= '0' && str1[i] <= '9'))
        {
            if (str1[i] == str2[i])
            {
                time[1] = str1[i];
                break;
            }

        }

    }

    for (int i = 0; i < strlen(str3) && i < strlen(str4); i++)
    {
        if ((str3[i] >= 'a' && str3[i] <= 'z') || (str3[i] >= 'A' && str3[i] <= 'Z'))
        {
            if (str3[i] == str4[i])
                fen = i;
        }
    }

//    cout << week[time[0]-'A'+1] << " ";
    if (time[1] >= '0' && time[1] <'9')
        shi = time[1] - '0';
    else
        shi = time[1] - 'A' + 10;

    printf("%s %02d:%02d", week[time[0]-'A'], shi, fen);
    return 0;
}