题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6685
题解:10 最多取1个,20最多取4个,50最多取一个,如果多了的话,就可以被更大的数替代,所以暴力10,20,50的个数,判断是否符合,直接找100的个数即可
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int f;
ll a[110];
int dfs(ll x, int i, int j, int k) {
for(int l1 = 0; l1 <= i; l1++)
for(int l2 = 0; l2 <= j; l2++)
for(int l3 = 0; l3 <= k; l3++)
if(l1 * 10 + l2 * 20 + l3 * 50 == x)
return 1;
return 0;
}
int main() {
int T;
int flag;
ll ans1 , ans2, ans3, ans4;
ll ans;
scanf("%d", &T);
while(T--) {
scanf("%d", &n);
flag = 0;
for(int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
if(a[i] % 10)
flag = 1;
}
if(flag) {
printf("-1\n");
continue;
}
ans = 10000000000;
ll cnt = 0;
ll tmp;
flag = 0;
for(int i = 0; i <= 1; i++) // 10
for(int j = 0; j <= 4; j++) // 20
for(int k = 0; k <= 1; k++) { // 50
cnt = 0;
flag = 1;
for(int l = 1; l <= n; l++) {
tmp = a[l];
f = 0;
if(tmp < 100) {
f = dfs(tmp, i, j, k);
if(f) continue;
else flag = 0;
} else {
f = dfs(tmp % 100 + 100, i , j , k );
if(f) cnt = max(cnt, (a[l] - 100) / 100);
else if(dfs(tmp % 100, i, j, k) ) cnt = max(cnt, a[l] / 100);
else flag = 0;
}
if(!flag) break;
}
if(flag) ans = min(ans, i + j + k + cnt);
}
printf("%lld\n", ans);
}
return 0;
}