PAT 甲级 1061 Dating (20 分)

题目描述

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.

输入

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.

输出

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.

思路

打表题,按照题目,找到第一个相等的字符以此类推

代码

#include<iostream>
#include<stdlib.h>
#include<string.h>
using namespace std;
char s1[100] = { 0 };
char s2[100] = { 0 };
char s3[100] = { 0 };
char s4[100] = { 0 };
char ans[150] = { 0 };
char D;
char H;
int M;
int main()
{
	cin.getline(s1, 100);
	cin.getline(s2, 100);
	cin.getline(s3, 100);
	cin.getline(s4, 100);
	int i = 0;
	int flag = 1;
	while (s1[i] != 0 && s2[i] != 0)
	{
		if (s1[i] == s2[i])
		{
			if (flag == 1)
			{
				if (s1[i] >= 'A' && s1[i] <= 'G')
				{
					D = s1[i];
					flag = 0;
				}
			}
			else
			{
				if ((s1[i] >= '0' && s1[i] <= '9') || (s1[i] >= 'A' && s1[i] <= 'N'))
				{
					H = s1[i];
					break;
				}
			}
			
		}
		i++;
	}
	i = 0;
	while (s3[i] != 0 && s4[i] != 0)
	{
		if (s3[i] == s4[i])
		{
			if ((s3[i] >= 'A' && s3[i] <= 'Z') || (s3[i] >= 'a' && s3[i] <= 'z'))
			{
				M = i;
				break;
			}
		}
		i++;
	}
	switch (D){
	case 'A':
		cout << "MON";
		break;
	case 'B':
		cout << "TUE";
		break;
	case 'C':
		cout << "WED";
		break;
	case 'D':
		cout << "THU";
		break;
	case 'E':
		cout << "FRI";
		break;
	case 'F':
		cout << "SAT";
		break;
	case 'G':
		cout << "SUN";
		break;
	}
	cout << " ";
	if (H >= '0' && H <= '9')
	{
		cout << "0" << H;
	}
	else
	{
		printf("%d", H - 55);
	}
	cout << ":";
	printf("%02d\n", M);
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值