dfs 标签

这一切还要从一群吃蝙蝠的人说起——dfs中等难度 有更新!

  |   0 评论   |   0 浏览

题目描述
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.