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 01 0 0 0 1 1 0 0 0 00 0 0 0 0 0 0 0 0 0
样例输出
-
#1:Can't be divided.#2:Can be divided.
来源
#include<stdio.h>
#include<string.h>
int a[11];
int dp[20005];//此时dp[i]表示是否能把i容量的背包装满
int main()
{
int cnt=1;
int i,j,k;
while(scanf("%d%d%d%d%d%d%d%d%d%d",&a[1],&a[2],&a[3],&a[4],&a[5],&a[6],&a[7],&a[8],&a[9],&a[10])!=EOF)
{
int sum=0;
for(i=1;i<=10;i++)
sum+=i*a[i];
if(sum==0)
break;
if(sum&1)//总价值为奇数,肯定不能平分 剪枝
{
printf("#%d:Can't be divided.\n\n",cnt++);
continue;
}
int temp=sum/2;
memset(dp,0,sizeof(dp)); //初始化,容量为i的背包不能够被装满
dp[0]=1;
for(i=1;i<=10;i++)//循环每种价格的珠宝
{
for(k=temp;k>=i;--k)//价值temp从多到少
{
if(dp[temp]) //如果存在,说明已经达成目标,退出循环
break;
for(j=1;j<=a[i]&&k>=i*j;j++) //多重背包
{
dp[k]=dp[k-j*i]?1:0; //dp[k]表示k容量的背包是否能够装满.
//这个三目表达式的意思是dp[k-j*i]值是否存在,若存在那么加上j个i价值珠宝,dp[k]也可以存在
}
}
}
if(!dp[temp])
printf("#%d:Can't be divided.\n\n",cnt++);
else
printf("#%d:Can be divided.\n\n",cnt++);
}
return 0;
}