Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 题解 » 

PAT 1061. Dating

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 <cstdio>
#include <ctype.h>

int main()
{
	char weekday[7][4] = {"MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN"};
	char t1[100], t2[100], *p1, *p2;

	scanf("%s%s", t1, t2), p1 = t1, p2 = t2; //找一对相等的A-G
	while (!(*p1 >= 'A' && *p1 <= 'G' && *p1 == *p2)) p1++, p2++;
	printf("%s ", weekday[*p1-'A']);

	p1++, p2++; //找一对相等的0-9或A-9
	while (!((*p1>='A' && *p1<='N' || isdigit(*p1)) && *p1 == *p2)) p1++, p2++;
	printf("%02d", *p1>='0' && *p1<='9' ? *p1-'0' : *p1-'A'+10);

	scanf("%s%s", t1, t2), p1 = t1, p2 = t2; //找一对相等的a-z或A-Z
	while (!(isalpha(*p1) && *p1 == *p2)) p1++, p2++;
	printf(":%02d\n", p1-t1);
}
上一篇: 下一篇:

我的博客

NoAlGo头像编程这件小事牵扯到太多的知识,很容易知其然而不知其所以然,但真正了不起的程序员对自己程序的每一个字节都了如指掌,要立足基础理论,努力提升自我的专业修养。

站内搜索

最新评论