###### HDU 1059- Dividing

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 eitherCan 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.

（注释那段超时了T T）

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int marble[10];
int hhh;
int flag;
int dp[100000];
/*void work(int now,int num)
{
if(now*2==hhh)
{
//printf("^^%d\n",now);
flag=1;
//return 1;
}
for(int i=num;i>=1;i--)
{
if(marble[i])
{
if(now+i<=hhh/2)
{
marble[i]--;
work(now+i,i);
//return 1;
if(flag)
{
break;
}
marble[i]++;
}

}
}
//  return 0;

}*/
int main (void)
{
int mark=0;
int t=1;
while(1)
{
mark=0;
for(int i=1;i<=6;i++)
{
scanf("%d",&marble[i]);
if(marble[i]==0)
mark++;
}
//  printf("%d!!\n",mark);
if(mark==6)
break;
//  int num;
//  int t=1;
printf("Collection #%d:\n",t++);
hhh=0;
for(int i=1;i<=6;i++)
{
hhh+=i*marble[i];
}
if(hhh%2!=0)
{

printf("Can't be divided.\n");
printf("\n");
continue;

}
int t=hhh/2;
int sum;
memset(dp,0,sizeof(dp));
dp[0]=1;
for(int i=1;i<=6;i++)
{
if(!marble[i])
continue;
for(int j=1;j<=marble[i];j*=2)
{
sum=j*i;
for(int k=t;k>=sum;k--)
{
if(dp[k-sum])
{
dp[k]=1;
printf("dp[%d]=1\n",k);
}
}
marble[i]-=j;//剩下的
}
sum=marble[i]*i;
if(sum)
{
for(int k=t;k>=sum;k--)

{
if(dp[k-sum])
{
dp[k]=1;
printf("dp[%d]=1\n",k);
}

}
}
}
if(dp[t])
printf("Can be divided.\n");
else
printf("Can't be divided.\n");
printf("\n");
}
return 0;
}


#### hdu 4963 Dividing a String 中途相遇法 2014 Multi-University Training Contest 9-1004

2014-08-20 16:46:04

#### HDU-4963 Dividing a String （枚举[中途相遇法]）

2016-04-09 18:59:26

#### hdu1059dividing 多重背包

2014-11-22 15:41:13

#### hdu1059 Dividing 我的ACM我的梦，回顾篇 完全背包

2014-05-23 12:00:29

#### hdu 5453 Dividing This Product(分块打表)

2015-10-08 13:42:23

#### HDU：Dividing

2016-09-06 19:55:55

#### hdu1059 Dividing（多重背包+二进制优化）

2015-09-18 11:05:11

#### HDU:6060 RXD and dividing （DFS）

2018-04-19 21:46:59

#### 杭电1059-多重背包

2016-04-04 12:42:32

#### HDU_5783_DivideTheSequence（贪心）

2016-08-03 15:17:42

## 不良信息举报

HDU 1059- Dividing