title: Algorithms training Sticks
the Categories:
- ACM
- dfs
tags: - Advanced the DFS
DATE: 2020-03-18 19:08:24
Remember the entry title dfs do? A number n of input and result m, the number of Q which can be combined into n m. The question is, start over again on the basis of the search can make up m on, be careful not to run multiple times dfs, but to recursive calls, because we can not determine to find a m a m is one, may not be legitimate. dfs coding style, there are two, one is positive, one is the reverse
problem
Questions algorithm training Sticks
Resource constraints
Time limit: 1.0s Memory Limit: 999.4MB
Sticks
| Time Limit: 1000MS | Memory Limit: 10000K | |
|---|---|---|
| Total Submissions: 113547 | Accepted: 26078 |
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 Format
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 Format
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
5
6
Subject to the effect
A plurality of test cases, the number of the first input line of the stick n, the number n of the next input row represents a different length of the stick, the stick may be composed of a length of k m long stick, the minimum value of the output of the k
