Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) A. Broken Clock

A. Broken Clock

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a broken clock. You know, that it is supposed to show time in 12- or 24-hours HH:MM format. In 12-hours format hours change from 1 to 12, while in 24-hours it changes from 0 to 23. In both formats minutes change from 0 to 59.

You are given a time in format HH:MM that is currently displayed on the broken clock. Your goal is to change minimum number of digits in order to make clocks display the correct time in the given format.

For example, if 00:99 is displayed, it is enough to replace the second 9 with 3 in order to get 00:39 that is a correct time in 24-hours format. However, to make 00:99 correct in 12-hours format, one has to change at least two digits. Additionally to the first change one can replace the second 0 with 1 and obtain 01:39.

Input

The first line of the input contains one integer 12 or 24, that denote 12-hours or 24-hours format respectively.

The second line contains the time in format HH:MM, that is currently displayed on the clock. First two characters stand for the hours, while next two show the minutes.

Output

The only line of the output should contain the time in format HH:MM that is a correct time in the given format. It should differ from the original in as few positions as possible. If there are many optimal solutions you can print any of them.

Examples

input

Copy

24
17:30

output

Copy

17:30

input

Copy

12
17:30

output

Copy

07:30

input

Copy

24
99:99

output

Copy

09:09

题意：修改时间，使显示的时间符合12小时制，或24小时制，随便怎么改，但要求变化的位数最少

题解：按12和24改一下超出的时间就好了，注意12小时制的00：--，和小时第一位大于1，第二位小于2时的情况，我在这w了很多次，24小时制也一样，一道细心题，需要考虑周全

代码：

#include <bits/stdc++.h>

using namespace std;

int main()

{

int n;

char t[10];

cin >> n >> t;

if (n == 12)

{

if (t[0] == '0'&&t[1] == '0')

t[1] = '1';

if (t[0]>'1')

{

t[0] = '0';

if (t[1] == '0')

t[0] = '1';

}

if (t[0] == '1'&&t[1]>'2')

{

t[0] = '0';

if (t[1] == '0')

t[0] = '1';

}

if (t[3]>'5')

{

t[3] = '0';

}

}

else

{

if (t[0]>'2')

t[0] = '0';

if (t[0] == '2'&&t[1]>'3')

t[0] = '0';

if (t[3]>'5')

{

t[3] = '0';

}

}

/*int h = t[1]-'0'+(t[0]-'0')*10;

int m = (t[3]-'0')*10+t[4]-'0';

if(m>=60)

{

h+=1;

m = m%60;

}

if(n==24)

h = h%24;

else

h = h%12;

t[0] = h/10+'0';

t[1] = h%10+'0';

t[3] = m/10+'0';

t[4] = m%10+'0';*/

cout << t << endl;

}