poj1014背包问题.docxVIP

DividingTime Limit:?1000MSMemory Limit:?10000KTotal Submissions:?46916Accepted:?11734DescriptionMarsha 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.InputEach 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.OutputFor each collection, output Collection #k:, where k is the number of the test case, and then either Can be divided. or Cant be divided..?Output a blank line after each test case.Sample Input1 0 1 2 0 0 1 0 0 0 1 1 0 0 0 0 0 0 Sample OutputCollection #1:Cant be divided.Collection #2:Can be divided.背包问题背包的最大重量就是大理石总重量的一半，只要正好能把这一半装满，就可以。大理石的价值和重量则就是它的价值了只要运用背包问题的函数就可以了代码#includeiostream#includealgorithm#includecstdio#includecstringusing namespace std;constint M=60005;intdp[M]; //M的值应为最大的重量值int a[7]; int v; intmaX(inta,int b){return ab?a:b;}void ZeroOnePack(intcost,int weight){