【題解】ZeroJudge i920: 12136 – Schedule of a Married Man

#include <iostream>
using namespace std;
 
int main() {
    int T;
    int h1, m1, h2, m2; // 時間格式 h1:m1
    int h3, m3, h4, m4;
    
    scanf("%d", &T);
    for (int i = 1; i <= T; i++) {
        scanf("%d:%d %d:%d", &h1, &m1, &h2, &m2);
        scanf("%d:%d %d:%d", &h3, &m3, &h4, &m4);
        // h3:m3 比 h2:m2 晚，或 h4:m4 比 h1:m1 早
        if (((h3 > h2) || (h3 == h2 && m3 > m2)) || ((h4 < h1) || (h4 == h1 && m4 < m1))) {
            printf("Case %d: Hits Meeting\n", i);
        } else {
            printf("Case %d: Mrs Meeting\n", i);
        }
    }
    return 0;
}