#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define MAXN 71
#define INF 0x3f3f3f3f
using namespace std;
inline int read()
{
	int x,y;
	char c=getchar();
	x=0,y=1;
	while(c<'0'||c>'9') {if(c=='-') y=-1;c=getchar();}
	while(c>='0'&&c<='9') {x=(x<<3)+(x<<1)+c-'0';c=getchar();}
	return x*y;
} 
bool cmp(int a,int b)
{
	return a>b;
}
int n;
int a[MAXN];
int sum=0;
int len=INF,m;
bool vis[MAXN]={false};
void search(int,int,int);
int minn=0;
bool flag=false;
int main()
{
	n=read();
	for(int i=1;i<=n;i++) 
	{
		a[i]=read();
		if(a[i]>50) continue;
		sum+=a[i];
		minn=max(minn,a[i]);
	}
	sort(a+1,a+1+n,cmp);
	for(int i=minn;i<=sum;i++)
	{
		if(sum%i==0)
		{
			memset(vis,false,sizeof(vis));
			for(int j=1;j<=n;j++)
				if(a[j]>50) vis[j]=true;
			len=i;
			vis[1]=true;
			flag=false;
			m=sum/i;
			search(1,1,len-a[1]);
			if(flag)
			{
				cout<<len;
				break;
			}
		}	
	}	
	return 0;
}
void search(int x,int y,int z)
{
	if(x==m) {flag=true;return;}
	if(z==0) 
	{
		int i;
		for(i=1;i<=n;i++) 
			if(!vis[i]) 
			{
				vis[i]=true;
				break;
			}
		search(x+1,i,len-a[i]);
	}
	int k;
	for(int i=y+1;i<=n;i++)
		if(!vis[i]&&z>=a[i])
		{
			vis[i]=true;
			search(x,i,z-a[i]);
			vis[i]=false;
			k=i;
			while(i<n&&a[i]==a[k]) i++;
			if(i==n) return;
		}
}

这个月的第三次求助

orz

样例能过