超级会员免费看
本文详细介绍了如何解决HDU在线判题系统中的1445题——sticks问题。内容包括问题描述、解题思路、C语言代码实现及输出输入示例，旨在帮助读者理解动态规划在解决此类问题中的应用。
Problem 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
订阅专栏 解锁全文
扫一扫
762
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
