Sicily 2401. Judges' Time Calculation

2401. Judges' Time Calculation

Constraints

Time Limit: 1 secs, Memory Limit: 256 MB

Description

In our region, the contest traditionally starts at 12:30 and lasts for 5 hours. If you are able to submit a solution at 12:39, the wise judges would determine that 9 minutes had elapsed since the start of the contest. Sadly, as the day grows longer, the judges have more trouble doing the calculations accurately (how quickly can you determine the elapsed time for a 3:21 submission?)

Having struggled for many years, the judges developed the following system. Before the contest starts, they place the following table on the board at the front of the room

When a problem is submitted with a given time-stamp, they determine which row of the table to use, based upon the hour of the time-stamp. Then, the formula in the right column is used to compute the number of elapsed minutes. For example, with a submission time of 12:39, the top row is applied with XX=39, leading to the elapsed minutes calculated as  39 - 30 = 9 . For a program submitted at 3:21, the fourth row is used to calculate  21 + 150 = 171  elapsed minutes.

Your goal is to develop a program that generates the appropriate table given knowledge of the starting time and duration of a contest.

Input

The input starts with a line containing a single integer  1 ≤ N ≤ 30  that is the number of cases. Following this are N lines, with each line containing integral values SH, SM, DH, DM separated by spaces. The values  1 ≤ SH ≤ 12  and  0 ≤ SM ≤ 59  respectively represent the hour and minute at which a contest starts. The values  0 ≤ DH ≤ 10  and  0 ≤ DM ≤ 59  represent the duration of the contest in terms of hours and minutes. A contest will last at least 1 minute and at most 10 hours and 59 minutes. This allows us to omit any A.M. or P.M. designations for the times.

Output

For each case, you are to produce a table formatted as shown in the Example Output. Any row in which the hour designator is a single digit (e.g., 5:XX) should have a single leading space, as should the header of the table just before the word "time".

The table must have a row for every hour block in which a program might be submitted. Assume that the earliest possible submission is precisely the contest starting time (i.e., 0 elapsed minutes), and that the latest possible submission has an elapsed time of the full duration of the contest (e.g., 5:30 in our region).

Sample Input

3
12 30 5 0
7 0 2 59
9 59 4 1

Sample Output

------+---------
 time | elapsed
------+---------
12:XX | XX - 30
 1:XX | XX + 30
 2:XX | XX + 90
 3:XX | XX + 150
 4:XX | XX + 210
 5:XX | XX + 270
------+---------
 time | elapsed
------+---------
 7:XX | XX
 8:XX | XX + 60
 9:XX | XX + 120
------+---------
 time | elapsed
------+---------
 9:XX | XX - 59
10:XX | XX + 1
11:XX | XX + 61
12:XX | XX + 121
 1:XX | XX + 181
 2:XX | XX + 241

Problem Source

每周一赛第四场

我是水题爆刷者。。。

#include <stdio.h>
int main() {
    int n, sh, sm, lh, lm, lm_sum, eh;
    scanf("%d", &n);
    while (n--) {
        scanf("%d%d%d%d", &sh, &sm, &lh, &lm);
        lm_sum = lh * 60 + lm;
        eh = sh + (lm_sum + sm) / 60;
        printf("------+---------\n time | elapsed\n------+---------\n");
        for (int i = sh; i <= eh; i++) {
            int out_i;
            out_i = (i - 1) % 12 + 1;
            printf("%2d:XX | XX", out_i);
            if (i == sh)
                if (sm == 0)
                    printf("\n");
                else
                    printf(" - %d\n", sm);
            else
                printf(" + %d\n", (60 - sm) + (i - sh - 1) * 60);
        }
    }
    return 0;
}