1.20 英语翻译打卡

链接：Dividing | JXNUOJ

描述：

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.

M和B要分弹珠。如果每个弹珠的价值相等，分弹珠这是非常容易的（对半分）。但是，弹珠的价值并不相等。所有他们决定给每个弹珠标上价值，价值区间从1-6，他们将要分到总价值相同的弹珠。但是，平分弹珠并不现实，尽管总价值为偶数。例如，有4个弹珠，价值分别为1，3，4，4.这样的情况他们不能平分。所以，你需要编写程序来检查是否有公平的分法。

输入：

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.

输入的每行代表所有弹珠的价值。每行包括6个合法的数，n1-n6.ni是它所表示的弹珠的价值。所以各个弹珠的价值表示为例如 1 0 1 2 0 0.弹珠的总数<20000.

最后一行输入0 0 0 0 0 0作结尾。无需运行最后一行。

输出：

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.

输出Collection #k:换行Can be divided. or Can't be divided.k表示输入的第几组测试数据。