Thank you! Your submission has been received!

Oops! Something went wrong while submitting the form

Thank you! Your submission has been received!

Oops! Something went wrong while submitting the form

3

$10- $30

**Problem : Digital Time 12**

The objective is to form the maximum possible time in the HH:MM:SS format using any six of nine given single digits (not necessarily distinct)

Given a set of nine single (not necessarily distinct) digits, say 0, 0, 1, 3, 4, 6, 7, 8, 9, it is possible to form many distinct times in a 12 hour time format HH:MM:SS, such as 10:36:40 or 01:39:46 by using each of the digits only once. The objective is to find the maximum possible valid time (00:00:01 to 12:00:00) that can be formed using some six of the nine digits exactly once. In this case, it is 10:49:38.

**Input**

A line consisting of a sequence of 9 (not necessarily distinct) single digits (any of 0-9) separated by commas. The sequence will be non-decreasing

**Output **

The maximum possible time in a 12 hour clock (00:00:01 to 12:00:00) in a HH:MM:SS form that can be formed by using some six of the nine given digits (in any order) precisely once each. If no combination of any six digits will form a valid time, the output should be the word - Impossible

**Example 1 **

Input:

0,0,1,1,3,5,6,7,7

Output:

11:57:37

The maximum valid time in a 12 hour clock that can be formed using some six of the 9 digits precisely once is 11:57:37

**Example 2 **

Input:

3,3,3,3,3,3,3,3,3

Output:

Impossible

No set of six digits from the input may be used to form a valid time.

0 rating(0 Reviews)