文件名称:stickcppl
介绍说明－－下载内容均来自于网络，请自行研究使用
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
-Input The input contains blocks of two lines. The first line contains the number of sticks par ts after cutting, there are at most 64 sticks. The second line contains the ains the lengths of those parts separated by the space. The last line of the file contains zero. O The output should utput contains the smallest p ossible 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 Sa mple Output 6 5
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
-Input The input contains blocks of two lines. The first line contains the number of sticks par ts after cutting, there are at most 64 sticks. The second line contains the ains the lengths of those parts separated by the space. The last line of the file contains zero. O The output should utput contains the smallest p ossible 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 Sa mple Output 6 5
(系统自动生成,下载前可以参看下载内容)
下载文件列表
新建 文本文档.txt