1061. Dating (20)

最新推荐文章于 2018-08-26 19:55:30 发布

原创最新推荐文章于 2018-08-26 19:55:30 发布 · 245 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#pat

浙大PAT 专栏收录该内容

96 篇文章

订阅专栏

本文探讨了Sherlock Holmes如何解读编码时间的故事，通过分析给定的字符串来确定日期和时间，包括星期几、小时和分钟。每个输入包含四组不超过60字符的字符串，而输出则是一个解码的时间格式，即“DAYHH:MM”。文章详细解释了如何从字符串中提取关键信息，并将其转换为正确的日期和时间表示。

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

1061. Dating (20)

时间限制

50 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

需要注意的是：

（1）注意第一次查找时，公共字母的范围是‘A’ ~ ‘G’,

（2）注意输出时，若为个位数，需要补0

（3）不要傻傻的用case，可以建立一个数组，存放相应输出。

#include<iostream>
#include<string>
#include <iomanip>
using namespace std;

int main()
{
	//freopen("in.txt","r",stdin);
	string s1,s2,s3,s4;
	getline(cin,s1);
	getline(cin,s2);
	getline(cin,s3);
	getline(cin,s4);
	int i=0;
	int k=0;

	//65 int m='A';
	//97 int s='a';
	while(k!=2)
	{
		if(k==0)
		{
			while(s1[i]>'G'||s1[i]<'A'||s1[i]!=s2[i])
			i++;
		}
		if(k==1)
		{
			i++;
			while((s1[i]>'N'||s1[i]<'A')||s1[i]!=s2[i])
			{
				if(s1[i]<='9'&&s1[i]>='0'&&s1[i]==s2[i])
					break;
				i++;
			}
		}
		k++;
		int m=s1[i]-'A'+1;
		if(k==1)
		{
			switch (m)
			{
				case 1:
					cout<<"MON ";
					break;
				case 2:
					cout<<"TUE ";
					break;
				case 3:
					cout<<"WED ";
					break;
				case 4:
					cout<<"THU ";
					break;
				case 5:
					cout<<"FRI ";
					break;
				case 6:
					cout<<"SAT ";
					break;
				case 7:
					cout<<"SUN ";
					break;
			};
		}
		if(k==2)
		{
			if(m>=0&&m<=14)
			{
				cout<<m+9;
			}
			else cout<<setw(2)<<setfill('0')<<s1[i];
		}
	}
	i=0;
	while(s3[i]!=s4[i]||s3[i]<'A'||s3[i]>'z')
		i++;
		
	cout<<":"<<setw(2)<<setfill('0')<<i;
	system("pause");
	return 0;

}