【26.34%】【codeforces 722A】Broken Clock
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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
24
17:30
output
17:30
input
12
17:30
output
07:30
input
24
99:99
output
09:09
【题解】
很容易想到如果超过了进制就把相应的位置的数字的第一位改为0;
但是有个坑点。
12进制的小时位
如果是20,不能改成00;
因为12进制是从1开始的。
方法是如果a%10==0,就把第一位改为1;
详细的看代码吧。
#include <cstdio>
int flag,a,b;
char s[50];
int main()
{
//freopen("F:\\rush.txt", "r", stdin);
scanf("%d", &flag);
scanf("%s", s);
int a = (s[0] - '0') * 10 + (s[1] - '0');
int b = (s[3] - '0') * 10 + s[4] - '0';
if (b > 59)
{
s[3] = '0';
}
if (flag == 12)
{
if (a > 12)
{
if ((a % 10) == 0)
{
s[0] = '1';
}
else
{
s[0] = '0';
}
}
else
if (a == 0)
{
s[0] = '1';
}
}
else
{
if (a > 23)
{
s[0] = '0';
}
}
printf("%s\n", s);
return 0;
}
最新文章
- centos虚拟机网络桥接配置
- 服务端的GET、POST请求
- Mac 下安装ruby,以及CocoaPods安装以及使用网摘
- 【转载】H264--1--编码原理以及I帧B帧P帧
- UI:tomcat(说话小程序)、相框动画、UISgmentcontrol、UISwitch
- Codeforces Round #201 (Div. 2) - C. Alice and Bob
- oracle db mos文章 翻译系列
- python学习笔记之八:迭代器和生成器
- 【SSRS】入门篇(二) -- 建立数据源
- 使用Git的hook实现代码的自动部署
- [LeetCode] Lonely Pixel II 孤独的像素之二
- ffmpeg 推流相关指令
- 1.1.4 PROB Greedy Gift Givers
- Web存储及文件拖拽
- 【leet-code】712. 两个字符串的最小ASCII删除和
- MPEG-1视屏压缩标准
- AssetBundle之LoadFromCacheOrDownload()取代";new WWW (url)的作用
- Unsupported gpu architecture &#39;compute_20&#39;
- JAVA 反射之Method
- 【剑指offer】删除链表中重复的节点,C++实现(链表)