poj1014

dp。

#include<iostream>
#include<cstring>
using namespace std;
int c = 1;
int n[6], v[6] = {1, 2, 3, 4, 5, 6};
bool dp[60005];
int main()
{
    int sum;
    while(cin >> n[0] >> n[1] >> n[2] >> n[3] >> n[4] >> n[5] && !(!n[0] && !n[1] && !n[2] && !n[3] && !n[4] && !n[5]))
    {
        memset(dp, false, sizeof(dp));
        sum = 0;
        for(int i = 0; i < 6; i ++)
            sum += v[i] * n[i];
        if(sum % 2)
        {
            cout << "Collection #" << c << ":\nCan't be divided.\n\n";
            c ++;
            continue;
        }
        dp[0] = true;
        int tmp;
        for(int i = 0; i < 6; i ++)
        {
            tmp = n[i];
            for(int j = 1; tmp > 0; j *= 2)
            {
                if(j > tmp)
                    j = tmp;
                tmp -= j;
                for(int k = sum / 2; k >= j * v[i]; k --)
                    if(dp[k - j * v[i]])
                        dp[k] = true;
            }
        }
        if(!dp[sum / 2])
            cout << "Collection #" << c << ":\nCan't be divided.\n\n";
        else
            cout << "Collection #" << c << ":\nCan be divided.\n\n";
        c ++;
    }
    // system("pause");
    return 0;
}