Hide

Problem E
Digital display

There is a suspicion that some officers cheat when reporting exact time of various events. They antedate important documents and gain enormous profit by that. To eliminate such practices, ACM decided to install big digital clock on the wall of each office. Thank to this, everyone can easily see the current time and verify that it is correctly recorded on documents.

Your task is to write a firmware for this digital clock. Digits will be shown using the classical seven-segment display.

Input Specification

On each line of the input, there are exactly five characters: two digits, a colon (“:”) and another two digits. These characters specify a time between 00:00 and 23:59, inclusive.

The last time is followed by a line containing the word “end”.

Output Specification

For each input line, print a display consisting of seven rows of exactly 29 characters each. The only characters allowed are dashes (“-”) for horizontal segments, pipes (“|”) for vertical segments, plus signs (“+”) for corners, small latin letter “o” for the colon between hours and minutes, and spaces (“ ”).

The area for each digit is exactly 5 characters wide and there are two empty columns (spaces) between neighboring digit areas or between a digit area and the colon. Exact digit shapes and placements can be seen in Sample Output.

Always print two empty lines after each time displayed. Also, print the word “end” on a line of its own at the end of the output.

Sample Input 1 Sample Output 1
16:47
23:59
00:08
end
    +  +---+     +   +  +---+
    |  |         |   |      |
    |  |      o  |   |      |
    +  +---+     +---+      +
    |  |   |  o      |      |
    |  |   |         |      |
    +  +---+         +      +


+---+  +---+     +---+  +---+
    |      |     |      |   |
    |      |  o  |      |   |
+---+  +---+     +---+  +---+
|          |  o      |      |
|          |         |      |
+---+  +---+     +---+  +---+


+---+  +---+     +---+  +---+
|   |  |   |     |   |  |   |
|   |  |   |  o  |   |  |   |
+   +  +   +     +   +  +---+
|   |  |   |  o  |   |  |   |
|   |  |   |     |   |  |   |
+---+  +---+     +---+  +---+


end

Please log in to submit a solution to this problem

Log in