Sticks(Central Europe 1995)
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u
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
题目简单翻译：
给你一个数n：
然后给你n个小木棍，把他们分成若干组，每组的总长度相等，求最短的总长度，使每组的总长度相等。
思路:
dfs,剪枝
把它分成若干组，从大到小搜索，使它们成为一组，直到搜到结果。
代码：
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std; int n,t[],vis[];
bool Get_Ans;
int Sum;
void dfs(int Length,int Now_Sum,int Now_Groups,int Aim_Groups,int Now_Position)
{
if(Now_Groups==Aim_Groups)//所有的组都收集齐了
{
Get_Ans=true;
return;
}
if(Now_Sum==Length) //收集齐了一组
{
dfs(Length,,Now_Groups+,Aim_Groups,);
}
for(int i=Now_Position;i<n&&!Get_Ans;i++)
{
if(!vis[i]&&t[i]+Now_Sum<=Length)
{
vis[i]=;
dfs(Length,Now_Sum+t[i],Now_Groups,Aim_Groups,i);
if(Get_Ans) return;
vis[i]=;
if(Now_Sum==||Now_Sum+t[i]==Length) return ;//剪枝
}
}
}
bool judge(int Length,int Groups)
{
memset(vis,,sizeof vis);
Get_Ans=false;
dfs(Length,,,Groups,);
return Get_Ans;
}
bool cmp(int a,int b)
{
return a>b;
}
int main()
{
while(scanf("%d",&n)!=EOF&&n)
{
Sum=;
for(int i=;i<n;i++) scanf("%d",&t[i]),Sum+=t[i];
sort(t,t+n,cmp);
int Ans=Sum;
for(int i=n;i>;i--)
if(Sum%i==&&t[n-]<=Sum/i&&judge(Sum/i,i))
{
Ans=Sum/i;
break;
}
printf("%d\n",Ans);
}
return ;
}