ACM学习历程—HDU 1059 Dividing（dp && 多重背包）

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#define N 1000000007

using namespace std;

int num[7], sum;
int vis[60005];
bool dp[60005];

bool Input()
{
    sum = 0;
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= 6; ++i)
    {
        scanf("%d", &num[i]);
        sum += i*num[i];
    }
    if (sum)
        return true;
    else
        return false;
}

void Work()
{
    if (sum % 2)
    {
        printf("Can‘t be divided.\n\n");
        return;
    }
    sum /= 2;
    dp[0] = true;
    for (int i = 1; i <= 6; ++i)
    {
        if (num[i] == 0)
            continue;
        memset(vis, 0, sizeof(vis));
        for (int j = i; j <= sum; j++)
        {
            if (dp[j-i] && !dp[j] && vis[j-i] < num[i])
            {
                dp[j] = true;
                vis[j] = vis[j-i]+1;
            }
        }
    }
    if (dp[sum])
        printf("Can be divided.\n\n");
    else
        printf("Can‘t be divided.\n\n");
}

int main()
{
    //freopen("test.in", "r", stdin);
    int times = 1;
    while (Input())
    {
        printf("Collection #%d:\n", times);
        Work();
        times++;
    }
    return 0;
}