A binary clock is a clock which displays traditional sexagesimal time (military format) in a binaryformat. The most common binary clock uses three columns or three rows of LEDs to represent zerosand ones. Each column (or row) represents a time-unit value.When three columns are used (vertically), the bottom row in each column represents 1 (or 20), witheach row above representing higher powers of two, up to 25 (or 32). To read each individual unit(hours, minutes or seconds) in the time, the user adds the values that each illuminated LEDrepresents, and then reads the time from left to right. The first column represents the hour, the nextcolumn represents the minute, and the last column represents the second.When three rows are used (horizontally), the right column in each row represents 1 (or 20), with eachcolumn left representing higher powers of two, up to 25 (or 32). To read each individual unit (hours,minutes or seconds) in the time, the user adds the values that each illuminated LED represents, andthen reads the time from top to bottom. The top row represents the hour, the next row represents theminute, and the bottom row represents the second.
For this problem you will read a time in sexagesimal time format, and output both the vertical andhorizontal binary clock values. The output will be formed by concatenating together the bits in eachcolumn (or row) to form two 18 character strings of 1 ’s and 0’s as shown below.
10:37:49 would be written vertically as 011001100010100011 and horizontally as
The first line of input contains a single integer N, (1 ￡ N ￡ 1000) which is the number of data sets thatfollow. Each data set consists of a single line of input containing the time in sexagesimal format.
For each data set, you should generate one line of output with the following values: The data setnumber as a decimal integer (start counting at one), a space, the binary time in vertical format (18binary digits), a space and the binary time in horizontal format (18 binary digits).
1 011001100010100011 001010100101110001
2 000000000000000001 000000000000000001
本题由旧版NOJ导入，来源：ACM ICPC Greater New York Region 2008