[贪心？]zju_1543
StripiesTime limit: 1 Seconds Memory limit: 32768K
Total Submit: 2578 Accepted Submit: 1191
Our chemical biologists have invented a new very useful form of life called stripies (in fact, they were first called in Russian - polosatiki, but the scientists had to invent an English name to apply for an international patent). The stripies are transparent amorphous amebiform creatures that live in flat colonies in a jelly-like nutrient medium. Most of the time the stripies are moving. When two of them collide a new stripie appears instead of them. Long observations made by our scientists enabled them to establish that the weight of the new stripie isn't equal to the sum of weights of two disappeared stripies that collided; nevertheless, they soon learned that when two stripies of weights m1 and m2 collide the weight of resulting stripie equals to 2*sqrt(m1*m2). Our chemical biologists are very anxious to know to what limits can decrease the total weight of a given colony of stripies.
You are to write a program that will help them to answer this question. You may assume that 3 or more stipies never collide together.
Input
The first line of the input file contains one integer N (1
Process to the end of file.
Output
The output file must contain one line with the minimal possible total weight of colony with the accuracy of three decimal digits after the point.
Sample Input
2
72
50
3
72
30
50
Sample Output
120.000
120.000
Submit Back Status 方法好像很简单，不过不会怎样证明。。。。 最小代价生成树的思路 那为什么不从最小的开始？
页:
[1]