时钟问题VS解不等式求交集

最新推荐文章于 2023-12-09 17:07:24 发布

Raise

最新推荐文章于 2023-12-09 17:07:24 发布

阅读量9.6k

点赞数

分类专栏：算法分析与设计 C++ 文章标签： acm

本文链接：https://blog.csdn.net/linraise/article/details/12263165

版权

博客探讨了时钟问题，特别是时钟的三根指针如何保持至少D度的距离以保持‘快乐’状态。通过数学分析，讨论了解决这类问题的关键在于求解不等式并找到三个集合的交集。文章提供了ACM竞赛中的相关问题作为背景，并给出了算法思路。

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

Tick and Tick

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

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.

Output

For each D, print in a single line the percentage of time in a day that all of the hands are happy, accurate up to 3 decimal places.

Sample Input

0 120 90 -1

Sample Output

100.000 0.000 6.251

Author

PAN, Minghao

Source