该卡常的都卡了，但是还是过不了，T了4个点。

#include<bits/stdc++.h>
using namespace std;
int n,m,maxx,vis[105],len,a[105];
bool pd;
#define ll long long
inline bool cmp(const int &x,const int &y) {return x>y;}
inline ll read()
{
    ll x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9')
	{
        if(c=='-')
          f=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9')
	{
        x=(x<<1)+(x<<3)+(c^48);
        c=getchar();
    }
    return x*f;
}
inline void dfs(int k,int last,int rest) 
{
	if (k==m) {pd=true; return;}
	if (rest==0)
	{
		int i;
		for (i=1;i<=n;++i)
		  if (vis[i]==0) break;
		vis[i]=1;
		dfs(k+1,i,len-a[i]);
		vis[i]=0;
	} 
	for (int i=last+1;i<=n;++i)
	{
		if (vis[i]==0&&a[i]<=rest)
		{
			vis[i]=1;
			dfs(k,i,rest-a[i]);
			vis[i]=0;
			if (pd==true) return;
			while (a[i]==a[i+1]) ++i; 
		} 
	} 
}
inline void init()
{
	n=read();
	for (int i=1;i<=n;++i) 
	{
		a[i]=read();
		maxx+=a[i]; 
	}
	sort(a+1,a+1+n,cmp);
}
int main()
{
	init();
	for (len=a[1];len<=maxx;++len)
	{
		if (maxx%len!=0) continue;
		pd=false;
		vis[1]=1;
		m=maxx/len;
		dfs(1,1,len-a[1]); 
		if (pd==true)
		{
			printf("%d\n",len);
			return 0;
		}
	} 
}