66分TLE求助！玄关

#include <bits/stdc++.h>
using namespace std;
const int N = 70;
int n, a[N], slen, len;
bool f[N];
bool dfs(int cnt, int sum, int idx) {
	if (cnt * len == slen) return true;
	if (sum == len) return dfs(cnt + 1, 0, 1);
	int fail = 0;
	for (int i = 1; i <= n; i++) {
		if (f[i] || a[i] + sum > len || a[i] == fail) continue;
		f[i] = true;
		if (dfs(cnt, sum + a[i], i + 1)) return true;
		f[i] = false;
		fail = a[i];
		if (sum == 0 || sum + a[i] == len) return false;
	}
	return false;
}
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		slen += a[i];
	}
	sort(a + 1, a + n + 1);
	reverse(a + 1, a + n + 1);
	for (len = a[1]; len <= slen; len++) {
		if (slen % len == 0 && dfs(0, 0, 1)) {
			cout << len;
			exit(0);
			return 0;
			break;
		}
	}
	return 0;
}