【HDOJ】1059 Dividing

多重背包。

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

 #define mymax(a, b) (a>b) ? a:b

 int c[];
 int dp[];

 void ZeroOnePack(int c, int v) {
     int i;

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

 void CompletePack(int c, int v) {
     int i;

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

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

 int main() {
     int t = , total;
     int i;

     while (  ) {
         total = ;
         for (i=; i<=; ++i) {
             scanf("%d", &c[i]);
             total += c[i]*i;
         }
         if (total == )
             break;
         printf("Collection #%d:\n", ++t);
         if (total & ) {
             printf("Can't be divided.\n\n");
             continue;
         }
         total >>= ;
         memset(dp, , sizeof(dp));
         dp[] = ;
         for (i=; i<=; ++i) {
             MultiPack(i, c[i], total);
             if (dp[total])
                 break;
         }
         if (dp[total])
             printf("Can be divided.\n\n");
         else
             printf("Can't be divided.\n\n");
     }

     return ;
 }