poj 1014 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 file describes one collection of marbles to be divided. The lines contain six non-negative integers n1 , . . . , 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 collection, 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.

Source

 
题目大意:有一些弹球,价值分布在1~6之间,每种价值的弹球都有一定数量,问能否把它们分成价值和相等的两堆。
 
其实就是一道多重背包。先求出价值总和,判能否被2整除。然后总价值除二,做多重背包。
 
AC CODE
 
program pku_1014;
var f:array[0..60000] of boolean;
      used:array[0..60000] of longint;
      v:array[1..6] of longint;
      all:longint;
//============================================================================
procedure work;
var i,j,sum:longint;
      flag:boolean;
begin
  flag:=true; inc(all); sum:=0;
  for i:=1 to 6 do
  begin
      read(v[i]); sum:=sum+v[i]*i;
      if v[i]>0 then flag:=false;
  end; if flag then halt;
  writeln('Collection #',all,':');
  if sum mod 2=1 then
  begin
      writeln('Can','''','t be divided.');
      writeln; exit;
  end; fillchar(f,sizeof(f),0);
  f[0]:=true; sum:=sum div 2;
  for i:=1 to 6 do
  begin
      fillchar(used,sizeof(used),0);
      for j:=i to sum do
          if not(f[j]) and (used[j-i]<v[i]) and f[j-i] then
          begin
              f[j]:=true; used[j]:=used[j-i]+1;
          end;
      if f[sum] then break;
  end;
  if f[sum] then
  begin
      writeln('Can be divided.');
      writeln;
  end else
  begin
      writeln('Can','''','t be divided.');
      writeln;
  end;
end;
//============================================================================
begin
  while not(seekeof) do work;
end.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值