Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 95944 | Accepted: 21585 |
Description
Input
Output
Sample Input
9 5 2 1 5 2 1 5 2 1 4 1 2 3 4 0
Sample Output
6 5
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int sticks[70], visit[70];
int sum, originally;
int cmp(const void *a, const void *b)
{
return *(int *)b - *(int *)a;
}
int dfs(int now, int n, int need, int num)
{
int last = -1;
if (need == 0) {
for (n = now; visit[n]; n++)
;
if (sticks[n] == -1) return 1;
visit[n] = 1;
if (dfs(n, n+1, originally-sticks[n], num-1))
return 1;
visit[n] = 0;
return 0;
}
for (; sticks[n] != -1; n++) {
if (!visit[n] && sticks[n] <= need && sticks[n] != last) {
visit[n] = 1;
if (dfs(now, n+1, need - sticks[n], num-1))
return 1;
visit[n] = 0;
last = sticks[n];
if (need - sticks[n] == 0)
break;
}
}
return 0;
}
int main()
{
int i, n, ok;
while (scanf("%d", &n), n) {
sum = 0;
memset(sticks, 0, sizeof(sticks));
memset(visit, 0, sizeof(visit));
for (i = 0; i < n; i++) {
scanf("%d", &sticks[i]);
sum += sticks[i];
}
qsort(sticks, 51, sizeof(sticks[0]), cmp);
sticks[n] = -1;
ok = 0;
for (i = sticks[0]; i <= sum/2; i++) {
if (sum % i == 0) {
originally = i;
visit[0] = 1;
if (dfs(0, 1, originally-sticks[0], n-1)) {
ok = 1;
printf("%d\n", i);
break;
}
}
}
if (!ok)
printf("%d\n", sum);
}
}