Dividing--hdu1059(动态规划)

Problem Description

Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, because then they could just split the collection in half. But unfortunately, some of the marbles are larger, or more beautiful than others. So, Marsha and Bill start by assigning a value, a natural number between one and six, to each marble. Now they want to divide the marbles so that each of them gets the same total value. 
Unfortunately, they realize that it might be impossible to divide the marbles in this way (even if the total value of all marbles is even). For example, if there are one marble 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 marbles.

 

Input

Each line in the input describes one collection of marbles to be divided. The lines consist of six non-negative integers n1, n2, ..., n6, where ni is the number of marbles of value i. So, the example from above would be described by the input-line ``1 0 1 2 0 0''. The maximum total number of marbles will be 20000.

The last line of the input file will be ``0 0 0 0 0 0''; do not process this line.

 

Output

For each colletcion, output ``Collection #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.

 

Sample Input

1 0 1 2 0 0

1 0 0 0 1 1

0 0 0 0 0 0

 

Sample Output

Collection #1:

Can't be divided.

 

 

Collection #2:

Can be divided.

 

本来我以为是背包  但是超时了   然后搜了题解   发现是动态规划   

好像背包也可以写 但是要用一个新算法    啊啊啊   东西好多   怎么办   学都学不完

 

好吧   先说这一道题

有6快大理石   每一块的价值是1 2 3 4 5 6   给你的六个数是每一个大理石的块数

 深搜搜一下就行了   上代码   一看就明白

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<stdlib.h>

using namespace std;

#define INF 0xfffffff
#define N 20
int flag,mid,a[N];

void Find(int ans,int s)
{
    if(flag)
        return;
    if(ans==mid)
    {
        flag=;
        return;
    }
    for(int i=s; i>=; i--)
    {
        if(a[i])
        {
            if(ans+i<=mid)
            {
                a[i]--;
                Find(ans+i,i);
                if(flag)
                    break;
            }
        }
    }
    return;
}

int main()
{
    int t=;
    while()
    {
        int sum=;
        for(int i=; i<=; i++)
        {
            scanf("%d",&a[i]);
            sum+=a[i]*i;
        }
        if(sum==)
            break;
        printf("Collection #%d:\n",t++);
        if(sum%==)
        {
            printf("Can't be divided.\n\n");
            continue;
        }
        flag=;
        mid=sum/;
        Find(,);
        if(flag==)
            printf("Can be divided.\n\n");
        else
            printf("Can't be divided.\n\n");
    }
    return ;
}