1061 Dating

解题代码

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
	char date[7][4] = { "MON","TUE","WED","THU","FRI","SAT","SUN" };
	char str1[61], str2[61], str3[61], str4[61];
	scanf("%s%s%s%s", str1,str2,str3, str4);
	bool flag = true;
	int len1 = strlen(str1), len2 = strlen(str2), len3 = strlen(str3), len4 = strlen(str4);
	int min1 = min(len1, len2), min2 = min(len3, len4);
	for (int i = 0; i < min1; i++) {
		if (flag && str1[i] == str2[i] && str1[i] >= 'A' && str1[i] <= 'G') {
			printf("%s ", date[str1[i] - 'A']);
			flag = false;
			continue;
		}
		if (!flag && str1[i] == str2[i] && (str1[i] >= '0' && str1[i] <= '9' || str1[i] >= 'A' && str1[i] <= 'N')) {
			if (str1[i] >= '0' && str1[i] <= '9')
				printf("%02d:", str1[i] - '0');
			else printf("%d:", str1[i] - 'A' + 10);
			break;
		}
	}
	for (int i = 0; i < min2; i++) {
		if (str3[i] == str4[i] && (str3[i] >= 'a' && str3[i] <= 'z' || str3[i] >= 'A' && str3[i] <= 'Z'))
			printf("%02d", i);
	}
	return 0;
}

测试结果

问题整理

1.字符串处理。