时钟问题VS解不等式求交集
Tick and Tick
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7884 Accepted Submission(s): 2177
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.
Sample Input
0 120 90 -1
Sample Output
100.000 0.000 6.251
Author
PAN, Minghao
Source
have_to_be_meng: 二叉树转森林那个每个结点的右孩子分支应该说清楚一点,我觉得应该是:根结点的右孩子,根节点右孩子的右孩子……也就是顺着这条线下去,把他分成n个二叉树树,再转换成树
剑玄录: 所以这里为什么要引入哈夫曼哈哈哈
叹了口丶气: 大佬能举个例子么
爱吃猫的小鱼干: 一般意义上是对的
m0_46879083: 森林的后序和二叉树中序遍历相同。你写错了