1061 Dating

最新推荐文章于 2024-07-15 22:53:16 发布

BugMaker0623

最新推荐文章于 2024-07-15 22:53:16 发布

阅读量20

点赞数 1

分类专栏：算法笔记文章标签：算法笔记

本文链接：https://blog.csdn.net/bugmaker623/article/details/135233970

版权

算法笔记专栏收录该内容

3 篇文章 0 订阅

订阅专栏

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.

~~非常好的题目，使我cpu旋转~~

一开始看英文题目，看得似懂非懂，无法下手。然后找到B级的中文题目，终于是看懂了意思，但是中文的题目也表述的非常模糊，主要有以下几个注意点：

1、星期几的信息来自前两个字符串的第一个相同的大写字母，并且范围是'A'-'G'，在写代码时要限定清楚，并不是第一个所有的大写字母得出序号再模7，不然测试点4过不去；

2、几点钟的信息，题目要求的是第二个相同的字符，事实上应该是在第一个相同的大写字母之后的第一个相同的字符，而不是从头开始的第二个相同的字符。

题目出得很好，下次不要再出了。

#include<iostream>
#include<cstring>

int convert(char ch)
{
    if(ch>='0'&&ch<='9')
        return ch-'0';
    else if(ch>='A'&&ch<='N')
        return ch-'A'+10;
    else
        return -1;
}

int main()
{
    char str[4][61];
    char week[7][4]={"MON","TUE","WED","THU","FRI","SAT","SUN"};
    scanf("%s\n%s\n%s\n%s",str[0],str[1],str[2],str[3]);
    int length = strlen(str[0]);
    char key[3];
    int count=0;
    for(int i=0;i<length;i++)
    {
        if(str[0][i]==str[1][i])
        {
            if(count==0)
            {
                if(str[0][i]>='A'&&str[0][i]<='G')
                {       
                    key[count++]=str[0][i];
                }
            }
            else if(count==1)
            {
                if((str[0][i]>='0'&&str[0][i]<='9')||(str[0][i]>='A'&&str[0][i]<='N'))
                {
                    key[count++]=str[0][i];
                    break;
                }
            }
        }
    }
    length = strlen(str[2]);
    for(int j=0;j<length;j++)
    {
        if(str[2][j]==str[3][j])
        {
            if((str[2][j]>='A'&&str[2][j]<='Z')||(str[2][j]>='a'&&str[2][j]<='z'))
            {
                key[2]='0'+j;
                break;
            }
        }
    }
    printf("%s %02d:%02d", week[key[0]-'A'], convert(key[1]), key[2]-'0');

    return 0;
}