Divideing Jewels

描述

Mary and Rose own a collection of jewells. They want to split the collection among themselves so that both receive an equal share of the jewels. This would be easy if all the jewels had the same value, because then they could just split the collection in half. But unfortunately, some of the jewels are larger, or more beautiful than others. So, Mary and Rose start by assigning a value, a natural number between one and ten, to each jewel. Now they want to divide the jewels so that each of them gets the same total value. Unfortunately, they realize that it might be impossible to divide the jewels in this way (even if the total value of all jewels is even). For example, if there are one jewel of value 1, one of value 3 and two of value 4, then they cannot be split into sets of equal value. So, they ask you to write a program that checks whether there is a fair partition of the jewels.

输入

Each line in the input file describes one collection of jewels to be divided. The lines contain ten non-negative integers n1 , . . . , n10 , where ni is the number of jewels of value i. The maximum total number of jewells will be 10000.
The last line of the input file will be "0 0 0 0 0 0 0 0 0 0"; do not process this line.

输出

For each collection, output "#k:", where k is the number of the test case, and then either "Can be divided." or "Can't be divided.".
Output a blank line after each test case.

样例输入

1 0 1 2 0 0 0 0 2 0
1 0 0 0 1 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0

样例输出

#1:Can't be divided.

#2:Can be divided. 

这道题要求将价值平分，第i个数表示价值为i的个数，

一看就很明显知道是多重背包问题，需要转换成0-1背包

或完全背包（只需要保存方案是否可行），所以可以采用

                         二进制的方法优化。

#include <stdio.h>
#include <string.h>
const int N = 15, maxn = 550005, M = 1005;
int a[N], pos, cnt[M];
bool dp[maxn];  //采用完全背包比0-1背包速度快,内存小很多
void Complete_back ( int n )
{
    int k = 1;
    pos = 0;
    while ( n >= k )
    {
        cnt[pos ++] = k;
        n = n-k;
        k = k << 1;
    }
    if ( n )
        cnt[pos ++] = n;
}
int main ( )
{
    int sum, cas = 1;
    while ( 1 )
    {
        sum = 0;
        memset ( dp, false, sizeof ( dp ) );
        for ( int i = 1; i <= 10; i ++ )
        {
            scanf ( "%d", &a[i] );
            sum = sum+a[i]*i;
        }
        if ( sum == 0 )
            break ;
        printf ( "#%d:", cas ++ );
        if ( sum%2 )    //奇数剪枝
        {
            printf ( "Can't be divided.\n" );
            continue ;
        }
        dp[0] = true;
        for ( int i = 1; i <= 10; i ++ )
        {
            Complete_back ( a[i] ); //转化为二进制位完全背包
            for ( int j = 0; j < pos; j ++ )
            {
                for ( int k = sum/2; k >= i*cnt[j]; k -- )
                {
                    if ( dp[ k-i*cnt[j] ] )
                        dp[k] = true;
                }
            }
        }
        printf ( dp[sum/2] ? "Can be divided.\n\n" : "Can't be divided.\n\n" );
    }
    return 0;
}