寒假翻译训练题 1月23号

链接：https://acs.jxnu.edu.cn/problem/HDU1006

题目：

描述：

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.

翻译如下

描述：

时钟上有3根指针一直在旋转，他们每天都会相遇很多次。突然，他们开始对这样的生活感到了厌倦，然后每一根指针开始尝试远离其他的指针。当一个指针离其他指针的距离不小于D时，它就会感到开心。你要计算出一天里有多久的时间，3根指针都很开心。

输入：

输入包含多组样例。每一组输出均只占一行，且只含有一个实数D（0 <= D <= 120）。当输入D的值为-1时，停止输入。

输出：

对于每一组样例，输出它们开心的时间，结果保留3位小数。