浙大oj-2106 Tick and Tick

dmt_csr

于 2019-03-07 22:41:11 发布

阅读量197

点赞数

分类专栏： c++ 数据结构与算法文章标签： c++ ZOJ

本文链接：https://blog.youkuaiyun.com/csr_monkey/article/details/88323017

版权

该博客主要介绍了如何解决浙大在线Judge（ZOJ）上的问题2106，即时钟三针在至少D度间隔时保持‘快乐’的时间占比。博客内容包括问题描述、输入输出格式以及一个简单的暴力解法，并给出了精确到小数点后三位的输出示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem

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.