换零钱问题 (加强版)
//============================================================================
// Name : Making Change.cpp
// Date : 2013/4/29 上午11:29:29
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 5550
#define PII pair<int,int\>
#define PB push\_back
#define oo (1<<29)
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int coin\[6\]={5,10,20,50,100,200};
int bossdp\[6\]\[M\];
int dp\[M\];
int num\[6\];
void pre(){
fill(&bossdp\[0\]\[0\],&bossdp\[6-1\]\[M-1\],oo);
bossdp\[0\]\[0\]=0;
for(int i=0;i<6;i++){
for(int j=0;j<M;j++){
if(i==0){
if(j-coin\[i\]>=0){
bossdp\[i\]\[j\]=bossdp\[i\]\[j-coin\[i\]\]+1;
}
}else{
if(j-coin\[i\]>=0)
bossdp\[i\]\[j\]=min(bossdp\[i-1\]\[j\],bossdp\[i\]\[j-coin\[i\]\]+1);
else
bossdp\[i\]\[j\]=bossdp\[i-1\]\[j\];
}
}
}
}
int main() {
ios\_base::sync\_with\_stdio(0);
pre();
while(~scanf("%d%d%d%d%d%d",&num\[0\],&num\[1\],&num\[2\],&num\[3\],&num\[4\],&num\[5\])){
float w;
int all=0;
for(int i=0;i<6;i++){
all+=num\[i\]\*coin\[i\];
}
if(all==0)break;
scanf("%f",&w);
w+=0.001;
int iw=(int)(w\*100);
// debug("%d %d\\n",iw,all);
fill(&dp\[0\],&dp\[M-1\],oo);
dp\[0\]=0;
for(int i=0;i<6;i++){
for(int j=0;j<num\[i\];j++){
for(int k=all;k>=coin\[i\];k--){
dp\[k\]=min(dp\[k\],dp\[k-coin\[i\]\]+1);
}
}
}
int minans=oo;
for(int i=all;i>=iw;i--){
minans=min(minans,dp\[i\]+bossdp\[5\]\[i-iw\]);
}
printf("%3d\\n",minans);
}
}