码迷,mamicode.com
首页 > 其他好文 > 详细

poj1011

时间:2014-07-18 15:28:57      阅读:234      评论:0      收藏:0      [点我收藏+]

标签:des   style   color   os   width   art   

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

程序逻辑分析:
1、

poj1011,布布扣,bubuko.com

poj1011

标签:des   style   color   os   width   art   

原文地址:http://www.cnblogs.com/premier/p/3852307.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!