【Intel Code Challenge Elimination Round (Div1 + Div2, combined) A】【暴力or讨论】Broken Clock 把给定时间修改到目标时间制_722a

本文链接：https://blog.csdn.net/snowy_smile/article/details/52726998

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

24
17:30

output

17:30

input

12
17:30

output

07:30

input

24
99:99

output

09:09

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<ctype.h>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<bitset>
#include<algorithm>
#include<time.h>
using namespace std;
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x,y) memcpy(x,y,sizeof(x))
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T1, class T2>inline void gmax(T1 &a, T2 b) { if (b>a)a = b; }
template <class T1, class T2>inline void gmin(T1 &a, T2 b) { if (b<a)a = b; }
const int N = 0, M = 0, Z = 1e9 + 7, inf = 0x3f3f3f3f;
template <class T1, class T2>inline void gadd(T1 &a, T2 b) { a = (a + b) % Z; }
int n;
int h, m;
int main()
{
	while (~scanf("%d", &n))
	{
		scanf("%d:%d", &h, &m);
		int ans = 0;
		if (n == 12)
		{
			if (h >= 1 && h <= 12);
			else
			{
				if (h % 10 == 0)h = 10;
				else h %= 10;
			}

			if (m >= 0 && m <= 59);
			else m %= 10;
		}
		else
		{
			if (h >= 0 && h <= 23);
			else h %= 10;

			if (m >= 0 && m <= 59);
			else m %= 10;
		}
		printf("%02d:%02d\n", h, m);
	}
	return 0;
}
/*
【trick&&吐槽】
只是多犹豫了一下，到手的hack就飞了>.<

【题意】
给你一个时钟时间ab:cd 
让你求出如果把这个时间改为12小时制或24小时制的时间，至少需要修改几个数字
12:[1~12][00~59]
24:[0~23][00~59]

【类型】
讨论or暴力

【分析】
这题可以直接暴力枚举给定时间制度下的合法时刻，然后算出其到初始时刻的最小修改次数，稳妥的方法
讨论的话，我们其实可以发现，一旦不满足要求，只要%=10就满足了，除了在12小时制下%=10变为0的这种特殊情况
特判一下即可

【时间复杂度&&优化】
O(1)

*/