hdu 1006 翻译

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.

问题描述：

        时钟的三个指针在不停的旋转，并且，每天会相遇多次。最后，它们对此感到着实无聊，因为它们每个都想远离另外的两个。一个指针和另外两个至少有D度，那么他会很快乐。你将要计算一天中会有多少时间所有的指针都是快乐的。

输入：

        输入多组测试用例，每个案例是写有一个实数D（0到120）的一行，输入D为-1终止。

输出：

        对于每一个D，打印一行，包含所求的时间占一天的百分比，准确到三位小数。