hdu 1085 Holding Bin-Laden Captive!（母函数）

int n1,n2,n5;
bool a[8005], b[8005];


int main(){

    while(scanf("%d%d%d",&n1,&n2,&n5)!=EOF,n1||n2||n5){
        mem(a,false);
        a[0]=true;
        int maxs=n1+2*n2+5*n5;

        mem(b,false);
        rep(i,0,maxs){
            if(a[i]==true){
                rep(k,0,n1){
                    if(i+k<=maxs){
                        b[i+k]=true;
                    }
                }
            }
        }
        rep(i,0,maxs) a[i]=b[i];


        mem(b,false);
        rep(i,0,maxs){
            if(a[i]==true){
                rep(k,0,n2){
                    if(i+2*k<=maxs){
                        b[i+2*k]=true;
                    }
                }
            }
        }
        rep(i,0,maxs) a[i]=b[i];


        mem(b,false);
        rep(i,0,maxs){
            if(a[i]==true){
                rep(k,0,n5){
                    if(i+5*k<=maxs){
                        b[i+5*k]=true;
                    }
                }
            }
        }
        rep(i,0,maxs) a[i]=b[i];

        int ans=-1;
        rep(i,0,maxs){
            if(a[i]==false){
                ans=i;
                break;
            }
        }
        if(ans==-1)
            ans=maxs+1;
        printf("%d\n",ans);

    }

    return 0;
}