POJ1011 （DFS+剪枝）

Sticks

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 129606		Accepted: 30388

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

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int a[], n;
bool vis[];
int Cmp(int a, int b)
{
    return a>b;
}

//len 是要构造的每段的长度。 cur是构造每段
//长度的过程中还需要的。 num是剩余的木棒数。
int dfs(int len, int cur, int num)
{
    if(cur==&&num==) return true;
    if(cur==) cur = len;
    for(int i=; i<n; i++)
    {
        if(vis[i]) continue;
        if(cur-a[i]>=)
        {
            vis[i] = ;
            if(dfs(len, cur-a[i], num-)) return true;
            vis[i] = ;
            if(a[i]==cur||cur==len) return false;//a[i]==cur
//满足一个木棒长度， 但是不满足全部的 cur==len是进行循环之后还是不满足
            while(a[i]==a[i+]&&i+<n) ++i;
        }
    }
    return false;
}

int main()
{
    while(scanf("%d", &n), n)
    {
        int sum = ;
        for(int i=; i<n; i++)
        {
            scanf("%d", &a[i]);
            sum+=a[i];
        }
        sort(a, a+n, Cmp);
        for(int i=a[]; i<=sum; i++)
        {
            if(sum%i==)
            {
                memset(vis, , sizeof(vis));
                if(dfs(i, , n))
                {
                    printf("%d\n", i);
                    break;
                }
            }
        }
    }
    return ;
}