1061 Dating（cctype）

最新推荐文章于 2024-06-06 11:23:36 发布

Oliver_H_

最新推荐文章于 2024-06-06 11:23:36 发布

阅读量260

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT甲级字符串

本文链接：https://blog.youkuaiyun.com/nnnnnick/article/details/99466572

PAT甲级同时被 2 个专栏收录

32 篇文章

订阅专栏

字符串

20 篇文章

订阅专栏

本文介绍了一个基于字符串匹配的算法，该算法用于解码Sherlock收到的神秘信息，从中找出隐藏的约会时间。通过对四组字符串进行比较，算法能够识别出共同的字符，并将其转换为具体的时间格式。

摘要生成于 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<cctype>
using namespace std;
/*
	以前做感觉很难，现在感觉很简单...其实就是判断三个条件：
	第一个，相同的大写字母（且A~G，很重要，不然有一个测试点不通过）
	第二个，相同的大写字母或者数字
	第三个，相同的字母的位置 
*/
int main(){
	string aa,bb,cc,dd;
	cin>>aa>>bb>>cc>>dd;
	char ch1,ch2;
	int i;
	for(i=0;i<aa.size()&&i<bb.size();i++){
		if(aa[i]==bb[i]&&aa[i]>='A'&&aa[i]<='G'){//A~G，不是A~Z 
			ch1=aa[i];
			break;
		}
	}
	i++;
	while(i<aa.size()&&i<bb.size()){
		if(aa[i]==bb[i]&&(aa[i]>='A'&&aa[i]<='N'||isdigit(aa[i]))){//isdigit，属于cctype
			ch2=aa[i];
			break;
		}
		i++;
	}
	int ch3;
	for(int j=0;j<cc.size()&&j<dd.size();j++){
		if(cc[j]==dd[j]&&isalpha(cc[j])){//islpha，属于cctype 
			ch3=j;
			break;
		}
	}
	string array[7]={"MON","TUE","WED","THU","FRI","SAT","SUN"};
	cout<<array[ch1-'A'];
	int ch2number=isdigit(ch2)?ch2-'0':ch2-'A'+10;//或者你用isupper+else也行 
	printf(" %02d:%02d",ch2number,ch3);
	return 0;
}