1059 Dividing 背包

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

/*
本题是对背包知识的复习题， 综合应用了， 背包前三讲的内容；
对于复习很有帮助。
*/

struct node
{
    int v;
    int m;
}s[10];
int temp;
int dp[200005];

void completePake(int v)
{
    for(int j = v; j <= temp; j++) {

        dp[j] = max(dp[j], dp[j - v] + v);
    }

}

void zeroOnePake(int v) {

    for(int j = temp; j >= v; j--) {

        dp[j] = max(dp[j], dp[j - v] + v);
    }

}
void solve(int v, int m) {

    if(v*m >= temp) {

        completePake(v);  //完全背包
        return;
    }

    int t = 1;
    while(t < m) {   //多重背包
        zeroOnePake(t*v); //01背包
        m -= t;
        t<<=1;
    }
    zeroOnePake(v*m);
}



int main()
{
    int q = 1;
    while(1) {

            int sum = 0;
        for(int i = 1; i <= 6; i++) {

            scanf("%d", &s[i].m);
            s[i].v = i;
            sum += s[i].m * i;
        }
        if(sum == 0)
            break;
        printf("Collection #%d:\n", q++);
        temp = sum/2;

        if(temp*2 == sum)
        {
            for(int i = 0; i < sum; i++)
                dp[i] = -999999;
            dp[0] = 0;
            for(int i = 1; i <= 6; i++) {

                solve(s[i].v, s[i].m);
            }
            if(dp[temp] < 0)
                printf("Can't be divided.\n");
            else
                printf("Can be divided.\n");
        }
        else
            printf("Can't be divided.\n");
        printf("\n");

    }
    return 0;
}