Problem:
Problem J: ICPC: Ideal Coin Payment and Change

Taro, a boy who hates any inefficiencies, pays coins so that the number of coins to be returned as change is minimized in order to do smoothly when he buys something.

One day, however, he doubt if this way is really efficient. When he pays more number of coins, a clerk consumes longer time to find the total value. Maybe he should pay with least possible number of coins.

Thinking for a while, he has decided to take the middle course. So he tries to minimize total number of paid coins and returned coins as change.

Now he is going to buy a product of P yen having several coins. Since he is not good at calculation, please write a program that computes the minimal number of coins.

You may assume following things:

There are 6 kinds of coins, 1 yen, 5 yen, 10 yen, 50 yen, 100 yen and 500 yen.

The total value of coins he has is at least P yen.

A clerk will return the change with least number of coins.

Input

Input file contains several data sets.
One data set has following format:

P N1 N5 N10 N50 N100 N500

Ni is an integer and is the number of coins of i yen that he have.

The end of input is denoted by a case where P = 0. You should output nothing for this data set.

Output

Output total number of coins that are paid and are returned.

Constraints

Judge data contains at most 100 data sets.

0 ≤ Ni ≤ 1000

Sample Input

123 3 0 2 0 1 1
999 9 9 9 9 9 9
0 0 0 0 0 0 0

Output for the Sample Input

6
3

Solution in C++ (judge verdict: Time Limit Exceeded)

#include <cstdio>
#include <cstring>
#define REP(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) REP(i,0,n)

int a[] = { 1, 5, 10, 50, 100, 500 };
int N[6];
int pay[666667], ret[666667];

int min(int x, int y) { return x < y ? x : y; }

int main()
{
	const int inf = 1000000000;
	REP(p, 1, 666667) if (!ret[p]) {
		int t = p;
		rep(i, 6) { int k=t/a[5-i]; ret[p]+=k; t-=k*a[5-i]; }
	}
	int P;
	while (scanf("%d", &P), P) {
		memset(pay, 0, sizeof(pay));
		int s = 0;
		rep(i, 6) { scanf("%d", N+i); s += a[i] * N[i]; }

		REP(p, 1, s+1) if (!pay[p]) {
			int t = p;
			int c = 0;
			rep(i, 6) { int k=min(N[5-i], t/a[5-i]); c+=k; t-=k*a[5-i]; }
			if (!t) pay[p]=c;
		}
		int res = inf;
		REP(p, P, s+1) if (pay[p]) res = min(res, pay[p]+ret[p-P]);
		printf("%d\n", res);
	}
	return 0;
}