1061. Dating (20)-PAT

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

zoushidexing

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

阅读量1.2k

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 ACM/POJ/PAT/九度

本文链接：https://blog.youkuaiyun.com/zhu_liangwei/article/details/10676777

算法同时被 2 个专栏收录

130 篇文章

订阅专栏

ACM/POJ/PAT/九度

130 篇文章

订阅专栏

通过寻找字符串中共同出现的大写字母和特定位置的小写字母来解析隐藏的日期和时间。该方法利用了特定字符在字符串中的位置，将它们转换为星期几、小时和分钟。

摘要生成于 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

注意题目的意思。

week 大写字母的A-G

hh 0-9 A-N

mm 位置

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
using namespace std;

const int N=80;
char w[7][4]={{"MON"},{"TUE"},{"WED"},{"THU"},{"FRI"},{"SAT"},{"SUN"}};
int main()
{
	char s1[N],s2[N],s3[N],s4[N];
	scanf("%s%s%s%s",s1,s2,s3,s4);
	int i=0;
	int week,hh,mm;
	while(i<strlen(s1)&&i<strlen(s2)){
		if(s1[i]==s2[i]&&s1[i]>='A'&&s1[i]<='G'){
			week=s1[i]-'A';
			break;
		}
		i++;
	}
	i++;
	while(i<strlen(s1)&&i<strlen(s2)){
		if(s1[i]==s2[i]&& ((s1[i]>='A'&&s1[i]<='N')||(s1[i]>='0'&&s1[i]<='9'))){
			if((s1[i]>='A'&&s1[i]<='N'))
				hh=s1[i]-'A'+10;
			else if(s1[i]>='0'&&s1[i]<='9')
				hh=s1[i]-'0';
			break;
		}
		i++;
	}
	i=0;
	while(i<strlen(s3)&&i<strlen(s4)){
		if(s3[i]==s4[i]&&((s3[i]>='A'&&s3[i]<='Z')||(s3[i]>='a'&&s3[i]<='z'))){
			mm=i;
			break;
		}
		i++;
	}
	printf("%s %02d:%02d\n",w[week],hh,mm);
	return 0;
}