Tick and Tick（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.

翻译：时钟上三个指针时刻在旋转，每天彼此相遇很多次.最终，他们对此厌倦，希望能够远离其他两个指针.当一个指针离其他指针D度时他会感到开心.你需要计算一天内所有的指针都感到开心的时间.

输入；输入有许多测试样例.他们之中每个单独一行，有一个数字D介于0和120之间.输入D时接-1.

输出：对于每个D，打印单独一行一天时间内所有指针开心时间的百分比，精确至小数点后3位