【HDOJ】2844 Coins

完全背包。

 #include <stdio.h>
 #include <string.h>

 int a[], c[];
 int n, m;
 int dp[];

 int mymax(int a, int b) {
     return a>b ? a:b;
 }

 void CompletePack(int c) {
     int i;

     for (i=c; i<=m; ++i)
         dp[i] = mymax(dp[i], dp[i-c]);
 }

 void ZeroOnePack(int c) {
     int i;

     for (i=m; i>=c; --i)
         dp[i] = mymax(dp[i], dp[i-c]);
 }

 void multipack(int c, int n) {
     int k;
     if (c*n >= m) {
         CompletePack(c);
         return ;
     }
     k = ;
     while (k < n) {
         ZeroOnePack(k*c);
         n -= k;
         k *= ;
     }
     ZeroOnePack(n*c);
 }

 int main() {
     int i, total;

     while (scanf("%d%d",&n,&m)!=EOF && (n||m)) {
         memset(dp, , sizeof(dp));
         dp[] = ;
         for (i=; i<=n; ++i)
             scanf("%d", &a[i]);
         for (i=; i<=n; ++i)
             scanf("%d", &c[i]);
         for (i=; i<=n; ++i)
             multipack(a[i], c[i]);
         total = ;
         for (i=; i<=m; ++i)
             if (dp[i])
                 ++total;
         printf("%d\n", total);
     }

     return ;
 }