|
大小: 891
备注:
|
← 于2008-02-23 15:35:51修订的的版本3 ⇥
大小: 970
备注: converted to 1.6 markup
|
| 删除的内容标记成这样。 | 加入的内容标记成这样。 |
| 行号 1: | 行号 1: |
| ## page was renamed from 程序设计练习23——zju2106——Tick and Tick |
Tick and Tick
Time limit: 1 Seconds
Memory limit: 32768K
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.
1. 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.
2. 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.