Problem G. Sticks
时间限制 1000 ms
内存限制 9.765625 MB
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.
输入数据
输出数据
The output should contains the smallest possible length of original sticks, one per line.
样例输入
复制
9
5 2 1 5 2 1 5 2 1
4
1 2 3 4
0
样例输出
$ Mathjax font initiator $