当前位置：网站首页>北京大学ACM Problems 1011：Sticks

北京大学ACM Problems 1011：Sticks

2022-04-21 13:30:00 【兔云程序】

Sticks

Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 173358 Accepted: 42418

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

版权声明
本文为[兔云程序]所创，转载请带上原文链接，感谢
https://blog.csdn.net/linjingtu/article/details/124311803

边栏推荐

猜你喜欢

随机推荐