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.

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<iostream>
#include<cstring>
using namespace std;
int main()
{
	char ans1[100],ans2[100],ans3[100],ans4[100];
	const char week[7][7]={"MON","TUE","WED","THU","FRI","SAT","SUN"};
	cin.get(ans1,100);
	getchar();
	cin.get(ans2,100);
	getchar();
	cin.get(ans3,100);
	getchar();
	cin.get(ans4,100);
	getchar();
//	printf("%s",ans1);
	int len1=strlen(ans1);
	int len2=strlen(ans2);
	int len3=strlen(ans3);
	int len4=strlen(ans4);
	int i;
	for(i = 0;i<len1&&i<len2;i++)
	{
		if(ans1[i]==ans2[i]&&ans1[i]>='A'&&ans1[i]<='G')
		{
			printf("%s ",week[ans1[i]-'A']);break; 
		}
	}
	for(i++;i<len1&&i<len2;i++)
	{
		if(ans1[i]==ans2[i])
		{
			if(ans1[i]>='0'&&ans1[i]<='9')
			{
				printf("%02d:",ans1[i]-'0');break; 
			}
			else if(ans1[i]>='A'&&ans1[i]<='N')
			{
				printf("%02d:",ans1[i]-'A'+10); break; 
			}
		}
	}
	for(int j=0;j<len3&&j<len4;j++)
	{
		if(ans3[j]==ans4[j]&&((ans3[j]>='A'&&ans3[j]<='Z')||(ans3[j]>='a'&&ans3[j]<='z')) )
		{
				printf("%02d",j);break;
		}
	}	
	return 0;
 } 

参考了柳婼解法，人家的解法是这个：

#include <iostream>
#include <cctype>
using namespace std;
int main() {
		string a, b, c, d;
		cin >> a >> b >> c >> d;
 		char t[2];
		int pos, i = 0, j = 0;
		while(i < a.length() && i < b.length()) {
				if (a[i] == b[i] && (a[i] >= 'A' && a[i] <= 'G')) {
						t[0] = a[i];
						break;
					}	
				i++;
				}
		 i = i + 1;
		 while (i < a.length() && i < b.length()) {
		 if (a[i] == b[i] && ((a[i] >= 'A' && a[i] <= 'N') || isdigit(a[i]))) {
				 t[1] = a[i];
				 break;
		 }
		 i++;
 }
			 while (j < c.length() && j < d.length()) {
					 if (c[j] == d[j] && isalpha(c[j])) {
					 pos = j;
					 break;
	 }
		 j++;
 }
 string week[7] = {"MON ", "TUE ", "WED ", "THU ", "FRI ", "SAT ", "SUN "};
 int m = isdigit(t[1]) ? t[1] - '0' : t[1] - 'A' + 10;
 cout << week[t[0]-'A'];
 printf("%02d:%02d", m, pos);
 return 0;
}

文章来源: blog.csdn.net，作者：沧夜2021，版权归原作者所有，如需转载，请联系作者。

原文链接：blog.csdn.net/CANGYE0504/article/details/104095802