PKU 1011

最新推荐文章于 2019-10-06 08:18:49 发布

原创最新推荐文章于 2019-10-06 08:18:49 发布 · 665 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#recursion #output #input #file #ini

解题报告专栏收录该内容

20 篇文章

订阅专栏

#include<stdio.h> #include<stdlib.h> int cmp(const void *a,const void *b) { return *(int *)b-*(int *)a; } int sticks[100];//记录每个木棒的长度，按照长度降序排列 bool used[100];//记录使用情况 bool recursion(int ,int ,int ,int ); int main() { int n,i,sum,len; while(scanf("%d",&n),n!=0) { sum=0; for(i=0;i<n;i++) { used[i]=false; scanf("%d",&sticks[i]); sum+=sticks[i]; } qsort(sticks,n,sizeof(sticks[0]),cmp); len=sticks[0];//len 的最小取值可能等于木棒中最长的一段； for(i=len;i<=sum;i++) { if(sum%i!=0)continue; if(recursion(n,n,0,i)) { printf("%d/n",i);break; } } } return 0; } bool recursion(int totalsticks,int unusedsticks,int left,int len) { int i; if(unusedsticks==0&&left==0)return true; if(left==0)left=len; for(i=0;i<totalsticks;i++) { if(used[i]==true)continue; if(sticks[i]>left)continue; used[i]=true; if(recursion(totalsticks,unusedsticks-1,left-sticks[i],len))return true; used[i]=false; if(sticks[i]==left||left==len)break; } return false; }

Sticks

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 69860		Accepted: 15263

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