Codeforces722 A. Broken Clock （orz）

最新推荐文章于 2018-12-29 19:16:28 发布

空白君有着一把空白键blanKey

最新推荐文章于 2018-12-29 19:16:28 发布

阅读量652

点赞数

分类专栏： ~~~~~acm~~~~~ ——Codeforces—— 智商水题 =====水=====

本文链接：https://blog.csdn.net/l954688947/article/details/52719915

版权

~~~~~acm~~~~~ 同时被 3 个专栏收录

182 篇文章 0 订阅

订阅专栏

——Codeforces——

57 篇文章 0 订阅

订阅专栏

=====水=====

33 篇文章 0 订阅

订阅专栏

题目连接：http://codeforces.com/contest/722/problem/A

解题思路：12小时制的1-12，24小时制的0-23。



#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <bitset>
using namespace std;

#define rep(i,a,b) for (int i=(a),_ed=(b);i<=_ed;i++)
#define per(i,a,b) for (int i=(b),_ed=(a);i>=_ed;i--)
#define pb push_back
#define mp make_pair
const int inf_int = 2e9;
const long long inf_ll = 2e18;
#define inf_add 0x3f3f3f3f
#define mod 1000000007
#define LL long long
#define ULL unsigned long long
#define MS0(X) memset((X), 0, sizeof((X)))
#define SelfType int
SelfType Gcd(SelfType p,SelfType q){return q==0?p:Gcd(q,p%q);}
SelfType Pow(SelfType p,SelfType q){SelfType ans=1;while(q){if(q&1)ans=ans*p;p=p*p;q>>=1;}return ans;}
#define Sd(X) int (X); scanf("%d", &X)
#define Sdd(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define Sddd(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define all(a) a.begin(), a.end()
#define   mem(x,v)      memset(x,v,sizeof(x))
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra*fh;}
//#pragma comment(linker, "/STACK:102400000,102400000")





int main()
{
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	n = read();
	int a,b;
	scanf("%d:%d",&a,&b);
	if(a>n)a%=10;
	if(n==24 && a==24)a%=10;
	if(n==12 && a==0) a = 10;
	if(b>=60)b%=10;
	if(a<10 && b<10)
        printf("0%d:0%d\n",a,b);
    else if(b<10)
        printf("%d:0%d\n",a,b);
    else if(a<10)
        printf("0%d:%d\n",a,b);
	else printf("%d:%d\n",a,b);


	return 0;
}