Tick and Tick（https://acs.jxnu.edu.cn/problem/HDU1006/editor）

题目：

Tick and Tick

描述：

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.

输入：

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.

输出：

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.

样例输入：

0
120
90
-1

复制

样例输出：

100.000
0.000
6.251

翻译：

描述：

闹钟的三个手每一秒都在以轴转动且每天相遇多次，最终，他们厌烦了并且他们每个都想远离其他两个，一个手是快乐的如果他至少和剩下的任何一个相差D度，你要算出在一天中所有的手是快乐的时间。

输入：

输入包含多组测试用例，每一个用例占一行，实数D在0到120之间，包括 0 和 120，输入以一个D和-1结束。

输出：

对于每个D，单行输出在一天中所有的手是快乐的时间的百分比，精确到小数点后三位。