HDU 1455 Sticks

  • 2018-08-14
  • 14
  • 0

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 file 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

题目链接

n根木棒是由m根长度为k的木棒拆分出来的,求最小k。

直接搜索匹配,注意剪枝。

AC代码:

评论

还没有任何评论,你来说两句吧