博易大师指标密码破解:急!!帮我看看哪里出错了~

来源:百度文库 编辑:神马品牌网 时间:2024/04/29 15:08:00
Sticks
Time Limit:1000MS Memory Limit:10000K
Total Submit:14981 Accepted:3778
Description
George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had originally and how long they were originally. Please help him and design a program which computes the smallest possible original length of those sticks. All lengths expressed in units are integers greater than zero.
Input
The input contains blocks of 2 lines. The first line contains the number of sticks parts after cutting, there are at most 64 sticks. The second line contains the lengths of those parts separated by the space. The last line of the file contains zero.
Output
The output should contains the smallest possible length of original sticks, one per line.
Sample Input
9
5 2 1 5 2 1 5 2 1
4
1 2 3 4
0
Sample Output
6
5
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~以上是题目~
~~~~~~~~~~~汗~提问的字数有限制的~
贴不了我的程序拉
哪为老大给我写一个好拉~
我拿回去借鉴借鉴也好~~~~