-
Notifications
You must be signed in to change notification settings - Fork 0
/
1028.cpp
53 lines (46 loc) · 1.03 KB
/
1028.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int p,n[6],m[6]={1,5,10,50,100,500};
int change[1000000];
int cntchange(int arg){
if(change[arg] != -1) return change[arg];
int origin = arg, ret = 0, tmp;
for(int i=5;i>=0;--i){
tmp = arg / m[i];
arg -= tmp * m[i];
ret += tmp;
}
return change[origin] = ret;
}
int possible(int arg){
int ret=0, tmp;
for(int i=5;i>=0;--i){
tmp = arg / m[i];
tmp = min(tmp, n[i]);
arg -= tmp * m[i];
ret += tmp;
}
return arg==0?ret:-1;
}
int main(){
int sum;
memset(change, -1, sizeof(change));
while(cin >> p && p){
int ub = 0;
for(int i=0;i<6;++i){
cin >> n[i];
ub += n[i] * m[i];
}
int ret = 1 << 20;
for(int i=p;i<=ub;++i){
int pay;
pay = possible(i);
if(pay != -1){
ret = min(ret, pay+cntchange(i-p));
}
}
cout << ret << endl;
}
}