A1061 Dating （20 分）/B1014 福尔摩斯的约会（20 分）

最新推荐文章于 2022-03-05 00:19:32 发布

Asterisk-.-

最新推荐文章于 2022-03-05 00:19:32 发布

阅读量172

点赞数 1

本文链接：https://blog.csdn.net/A_Aria/article/details/85930329

版权

#include<cstdio>
#include<cstring>
int main()
{
	char str1[65], str2[65], str3[65], str4[65];
	char day[7][7] = { "MON","TUE","WED","THU", "FRI", "SAT","SUN" };
	scanf("%s", str1);
	scanf("%s", str2);
	scanf("%s", str3);
	scanf("%s", str4);
	int len1, len3;
	len1 = strlen(str1);
	len3 = strlen(str3);//因为题目说测试点都有唯一解，所以只要满足一个长度成立即可
	int k;
	for (int i = 0; i < len1; i++)
	{
		if (str1[i] == str2[i]&&str1[i]>='A'&&str1[i]<='G')
		{
			printf("%s ",day[str1[i]-'A']);
			k = i;
			break;
		}
	}
	for (int i = k + 1; i < len1; i++)
	{
		if (str1[i] == str2[i])
		{
			if (str1[i] >= '0'&&str1[i] <= '9')
			{
				printf("%02d:", str1[i] - '0');
				break;
			}
			if (str1[i] >= 'A'&&str1[i] <= 'N')
			{
				printf("%02d:", str1[i] - 'A' + 10);
				break;
			}
		}
	}
	for (int j = 0; j < len3; j++)
	{
		if (str3[j] == str4[j] )
		{
			if (str3[j] >= 'a'&&str3[j] <= 'z' || str3[j] >= 'A'&&str3[j] <= 'Z')
			{
				printf("%02d", j);
				break;
			}
		}
	}

	return 0;
}