1061. Dating (20)

#include <iostream>
#include <cstdio>
using namespace std;

#define N 100

char *day[] = { "MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN" };

int main(int argc, char **argv) {
	char s1[N], s2[N], *p1, *p2;
	scanf("%s%s", s1, s2);

	for(p1 = s1, p2 = s2; *p1 && *p2; p1++, p2++) {
		if(*p1 == *p2 && *p1 <= 'G' && *p1 >= 'A') {
			cout << day[*p1 - 'A'] << ' ';
			break;
		}
	}
	for(p1++, p2++; *p1 && *p2; p1++, p2++) {
		if(*p1 == *p2) {
			if(*p1 >= '0' && *p1 <= '9') {
				printf("%02d:", *p1-'0');
				break;
			}
			else if(*p1 >= 'A' && *p1 <= 'N') {
				printf("%02d:", *p1-'A'+10);
				break;
			}
		}
	}

	scanf("%s%s", s1, s2);
	for(p1 = s1, p2 = s2; *p1 && *p2; p1++, p2++) {
		if(*p1 == *p2 && (*p1 >= 'A' && *p1 <= 'Z' || *p1 >= 'a' && *p1 <= 'z'))
			break;
	}

	printf("%02d\n", p1-s1);

	return 0;
}