zoukankan      html  css  js  c++  java
  • UVa 10339

    It has been said that a watch that is stopped keeps better time than one that loses 1 second per day. The one that is stopped reads the correct time twice a day while the one that loses 1 second per day is correct only once every 43,200 days. This maxim applies to old fashioned 12-hour analog watches, whose hands move continuously (most digital watches would display nothing at all if stopped).

         Given two such analog watches, both synchronized to midnight, that keep time at a constant rate but run slow by k and m seconds per day respectively, what time will the watches show when next they have exactly the same time?

    Input

    Input consists of a number of lines, each with two distinct non-negative integers k and m between 0 and 256, indicating the number of seconds per day that each watch loses.

    Output

    For each line of input, print k, m, and the time displayed on each watch, rounded to the nearest minute. Valid times range from 01:00 to 12:59.

    Sample Input

    1 2

    0 7

    Sample Output

    1 2 12:00

    0 7 10:17

    题意:两个时钟,一个每天慢a秒,一个每天慢b秒,问两钟重新相遇的时刻
    1圈有12 * 60 * 60秒,然后1圈 / abs(a - b),就可以求出多少天会相遇,然后就能求出A钟一共慢了多少秒,进而可以求出该时刻的时和分
    代码:
     1 #include <stdio.h>
     2 #include <string.h>
     3 #include <stdlib.h>
     4 #include <iostream>
     5 using namespace std;
     6 int k, m;
     7 int main() {
     8     while(scanf("%d%d",&k,&m)!=EOF){
     9         int d=abs(m-k);
    10         int min=(int)(12*60*1.0/d *(24*60*60-k)+0.5)%(24*60);
    11         int h=min/60;
    12         min%=60;
    13         h%=12;
    14         if(h==0) h=12;
    15         printf("%d %d %02d:%02d
    ",k,m,h,min);
    16     }
    17     return 0;
    18 }
  • 相关阅读:
    SAX方式解析XML文件实例
    DOM方式解析XML文件实例
    国外程序员整理的Java资源
    研发十大站点
    UMA
    [转]Hadoop YARN任务提交流程
    JAVA的内存模型
    2014年总结
    Storm因机器断电等,启动supervisor异常
    Python几个算法实现
  • 原文地址:https://www.cnblogs.com/wydxry/p/7245305.html
Copyright © 2011-2022 走看看