杭电ACM OJ 1006 Tick and Tick 厌倦时钟其实就是简单的数学题

最新推荐文章于 2020-01-15 17:41:45 发布

徐乙

最新推荐文章于 2020-01-15 17:41:45 发布

阅读量2.1k

点赞数

分类专栏：算法题文章标签：杭电ACM OJ 1006 Tick and Tick 时钟问题算法

本文链接：https://blog.csdn.net/qq_36523667/article/details/78502114

版权

这篇博客主要解析杭电ACM在线判题系统OJ中的1006题——Tick and Tick，题目实质上是一个基础的数学问题。作者通过分析，揭示了问题的本质，帮助读者理解并解决这类时钟问题，适合对算法和数学感兴趣的读者。

摘要由CSDN通过智能技术生成

Tick and Tick

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 20152 Accepted Submission(s): 5269

Problem Description

The three hands of the clock are rotating every second and meeting each other many times everyday. Finally, they get bored of this and each of them would like to stay away from the other two. A hand is happy if it is at least D degrees from any of the rest. You are to calculate how much time in a day that all the hands are happy.

Input

The input contains many test cases. Each of them has a single line with a real number D between 0 and 120, inclusively. The input is terminated with a D of -1.