1014.福尔摩斯的约会

最新推荐文章于 2022-11-19 16:34:58 发布

huanle543

最新推荐文章于 2022-11-19 16:34:58 发布

阅读量301

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/huanle543/article/details/50240119

版权

PAT 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

这里写图片描述

#include <iostream>
#include <string>
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
    string s1, s2, s3, s4;
    string week[] = { "MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN" };

    int mark = 0;
    cin >> s1 >> s2 >> s3 >> s4;
    for (int i = 0; i < s1.length() && i < s2.length();++i)
    {
        if (s1[i]==s2[i])
        {
            if (mark == 0)
            {
                if (s1[i] >= 'A'&&s1[i] <= 'G')
                {
                    cout << week[s1[i] - 'A'] << ' ';
                    mark = 1;
                }

            }
            else if (mark == 1)
            {
                if (s1[i] >= '0'&&s1[i] <= '9')
                {
                    cout << "0"<<s1[i] - 0x30 << ":";
                    mark = 2;
                }
                else if (s1[i] >= 'A'&&s1[i] <= 'N')
                {
                    cout << s1[i] - 'A' + 10 << ":";
                    mark = 2;
                }
            }
        }
    }
    int mark2 = 0;
    for (int i = 0; i < s3.length() && i < s4.length();++i)
    {
        if (s3[i]==s4[i])
        {
            if (mark2 == 0 && (s3[i] >= 'a'&&s3[i] <= 'z' || s3[i] >= 'A'&&s3[i] <= 'Z'))          //哔了狗，题目也不讲清楚大小写都算
            {
                if (i <= 9)
                {
                    cout << "0" << i << endl;
                }
                else
                    cout << i << endl;
                mark2 = 1;
            }   
        }
    }
    return 0;
}