【PAT甲级真题】- Dating(20)

题目来源

Dating - 牛客
Dating - PTA

Description

herlock 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 4 4 4th day in a week; the second common character is the 5th capital letter E, representing the 14 14 14th hour (hence the hours from 0 0 0 to 23 23 23 in a day are represented by the numbers from 0 0 0 to 9 9 9 and the capital letters from A A A to N N N, respectively); and the English letter shared by the last two strings is s at the 4th position, representing the 4 4 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 4 4 non-empty strings of no more than 60 60 60 characters without white space in 4 4 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 3 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

题目大意

给出 4 4 4 个字符串密码,按照要求解码

  1. 星期几由前两个字符串的第一个位置相同字母相同的大写字母决定,这个字母是字母表的第几个字母决定是星期几
  2. 小时由前两个字符串的第二个位置相同字符相同的数字或者大写字母 决定, 0 , 9 0,9 0,9 表示 0 0 0 点到 9 9 9 点, A , N A,N A,N 表示 10 10 10 点到 23 23 23 点
  3. 分钟由后两个字符串第一个相同的英文字母的位置 决定,位置为 i i i 即为第 i i i 分钟

思路简介

读懂题目就直接模拟即可

遇到的问题

  1. 判断星期时,可能会出现相同字母大于 G 的情况,即大于第 7 7 7 个字母,要忽略

这点PTA是有测试数据的,但是牛客上没有

代码

cpp 复制代码
/**
 * Dating
 * https://www.nowcoder.com/pat/5/problem/4028
 * https://pintia.cn/problem-sets/994805342720868352/exam/problems/type/7?problemSetProblemId=994805411985604608
 * 模拟
 */
#include<bits/stdc++.h>
using namespace std;

string res1[]={"MON ","TUE ","WED ","THU ","FRI ","SAT ","SUN "};

void solve(){
    string s1,s2,s3,s4;
    cin>>s1>>s2>>s3>>s4;
    int k1=0;
    while(s1[k1]!=s2[k1]||!(s1[k1]>='A'&&s1[k1]<='G'))k1++;
    cout<<res1[s1[k1++]-'A'];//星期
    
    while(s1[k1]!=s2[k1]||!((s1[k1]>='0'&&s1[k1]<='9')||(s1[k1]>='A'&&s1[k1]<='N')))k1++;
    //cout<<s1[k1]<<'\n';
    cout<<setfill('0')<<setw(2)<<(s1[k1]>='0'&&s1[k1]<='9'?s1[k1]-'0':s1[k1]-'A'+10);//24进制时间
    
    k1=0;
    while(s3[k1]!=s4[k1]||!((s3[k1]>='a'&&s3[k1]<='z')||(s3[k1]>='A'&&s3[k1]<='Z')))k1++;
    cout<<':'<<setfill('0')<<setw(2)<<k1<<'\n';//分钟
}

int main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //fstream in("in.txt",ios::in);cin.rdbuf(in.rdbuf());
    int T=1;
    //cin>>T;
    while(T--){
        solve();
    }
    return 0;
}
相关推荐
凡人叶枫2 小时前
Effective C++ 条款40:明智而审慎地使用多重继承
java·数据库·c++·嵌入式开发·effective c++
ShineWinsu2 小时前
对于Linux:线程局部存储(TLS)和线程封装的解析
linux·c++·面试·线程·tls·线程封装·线程局部存储
工头阿乐2 小时前
使用Conan构建现代C++项目:完整指南
开发语言·c++
思麟呀2 小时前
C++14概述与三大核心语法改进
开发语言·c++
Lhan.zzZ2 小时前
Qt Quick 嵌套 Dialog 与 ComboBox 层级混乱问题解决
c++·qt
Irissgwe2 小时前
AVL树详解
数据结构·c++·算法·二叉树·c·二叉搜索树·avl
剑锋所指,所向披靡!3 小时前
进程间通信IPC
c++
小小晓.3 小时前
零基础C++小白突破
开发语言·c++
阿i索3 小时前
【C++学习笔记】【基础】4.string类(2)——模拟实现
c++·笔记·学习
我不是懒洋洋3 小时前
从零实现一个消息队列:生产消费与持久化
c++