zoukankan      html  css  js  c++  java
  • CodeForces 722A

    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

    24
    17:30

    output

    17:30

    input

    12
    17:30

    output

    07:30

    input

    24
    99:99

    output

    09:09
     1 //2016.10.1
     2 #include <iostream>
     3 #include <cstdio>
     4 #include <cstring>
     5 
     6 using namespace std;
     7 
     8 int main()
     9 {
    10     int format, hh, mm;
    11     while(scanf("%d", &format)!=EOF)
    12     {
    13         scanf("%d:%d", &hh, &mm);
    14         if(format==12)
    15         {
    16             if(hh == 0)hh++;
    17             else if(hh<1 || hh > 12)
    18             {
    19                 if(hh%10 == 0)hh = 10;
    20                 else hh %= 10;
    21             }
    22             if(mm<0 || mm > 59)mm%=10;
    23             printf("%02d:%02d
    ", hh, mm);    
    24         }else
    25         {
    26             if(hh<0 || hh > 23)hh%=10;
    27             if(mm<0 || mm > 59)mm%=10;
    28             printf("%02d:%02d
    ", hh, mm);
    29         }
    30     }
    31 
    32     return 0;
    33 }
  • 相关阅读:
    Windows徽标键(WinKey)的屏蔽和恢复
    合肥轨道交通线路图(2025+ / 运营版)
    cmake未找到命令解决
    python3 用requests.get获取网页内容为空 <Response [200]>
    磁盘问题修复
    双机热备vrrp
    华为 nat策略
    策略实验2
    防火墙安全策略
    华为防火墙策略配置(http、icmp包允许通过)
  • 原文地址:https://www.cnblogs.com/Penn000/p/5927235.html
Copyright © 2011-2022 走看看