UVA 307 Sticks

分析

将一些相同长度的木棍切成多段不超过50的小木棍，现在给出n条小木棍的长度。问原本木棍最短的长度。

这里易知，木棍最短的长度理想是所给小木棍最长的长度，可以尝试性遍历所有的可能长度（木棍最多n条，长度最短max(s/n,m)）。用这样一个长度尝试性地拼木棍，如果长度不够，那么继续下钻，如果长度合适，从头继续拼。如果遍历所有木棍都不能拼起，那么尝试下一个长度。

代码

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <functional>
#define MAX_N 100
using std::sort;
using std::greater;

int N, L[MAX_N], s, m, r;
bool used[MAX_N];

bool dfs(int n, int p, int l)
{
    if (n == N) return true;
    for (int i = p; i < N; i++) {
        if (used[i]) continue;
        if (l + L[i] < r) {
            used[i] = true;
            if (dfs(n + 1, i + 1, l + L[i])) return true;
            used[i] = false;
            while (L[i + 1] == L[i] && i + 1 < N) i++;
            if (l == 0) return false;
        } else if (l + L[i] == r) {
            used[i] = true;
            if (dfs(n + 1, 0, 0)) return true;
            used[i] = false;
            return false;
        }
    }
    return false;
}

void solve()
{
    sort(L, L + N, greater<int>());
    for (int i = N; i > 0; i--)
        if (s % i == 0 && (r = s / i) >= m) {
            memset(used, false, sizeof(used));
            if (dfs(0, 0, 0)) { printf("%d\n", r); return;}
        }
}

int main()
{
    while (scanf("%d", &N), N) {
        s = m = 0;
        for (int i = 0; i < N; i++) {
            scanf("%d", &L[i]);
            s += L[i];
            m = L[i] > m ? L[i] : m;
        }
        solve();
    }
    return 0;
}

题目

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 file contains blocks of 2 lines. The first line contains the number of sticks parts after cutting. The second line contains the lengths of those parts separated by the space. The last line of the file contains zero.

Output

The output file 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