1061 Dating (20 分)(字符串处理)

在一则神秘信息中,Sherlock Holmes迅速解码出了一段约会时间:周四14:04。通过分析两组字符串中共同出现的特定字符,他识别出了日期和时间的编码方式。本篇详细解析了这一过程,展示了如何使用编程技巧来解决类似谜题。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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 <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cctype>
#include <string.h>
#include <cstdio>
using namespace std;
int main(){
    string week[7]={"MON","TUE","WED","THU","FRI","SAT","SUN"};
    string a,b,c,d;
    cin>>a>>b>>c>>d;
    int i=0;
    char t[2];
    while(i<a.length()&&i<b.length()){
        if(a[i]==b[i]&&(a[i]>='A'&&a[i]<='G')){
            t[0]=a[i];
            break;
        }
        i++;
    }
    i+=1;
    while(i<a.length()&&i<b.length()){
        if(a[i]==b[i]&&((a[i]>='A'&&a[i]<='N')||isdigit(a[i]))){
            t[1]=a[i];
            break;
        }
        i++;
    }
    int j=0,pos=0;
    while(j<c.length()&&j<d.length()){
        if(c[j]==d[j]&&isalpha(c[j])){
            pos=j;
            break;
        }
        j++;
    }
    int m=isdigit(t[1])?t[1]-'0':t[1]-'A'+10;
    cout<<week[t[0]-'A'];
    printf(" %02d:%02d",m,pos);
    return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

小火汁猛猛

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值