Divideing Jewels

Divideing Jewels

时间限制：1000 ms  |  内存限制：65535 KB

难度：4

描述

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.

package hpu.edu;import java.util.Scanner;public class Ny546{private static final int N = 10;private static int max;private static int[] arr = new int[N+1];private static boolean[] dp;public static void main(String[] args) {Scanner sc = new Scanner(System.in);int count = 0;while(sc.hasNextInt()) {count ++;max = 0;for(int i=1; i<=N; i++) {arr[i] = sc.nextInt();max += arr[i]*i;}if(max == 0) break;if((max&1) == 0) {max >>= 1;dp = new boolean[100000+1];if(solve() == true) {System.out.println("#"+ count + ":Can be divided.");} else {System.out.println("#"+ count + ":Can't be divided.");}} else {System.out.println("#"+ count + ":Can't be divided.");}}}private static boolean solve() {dp[0] = true;for(int i=1; i<=N; i++) {for(int j=1; j<=arr[i]; j++) {for(int k=max; k>=i; k--) {if(dp[k-i] == true) {dp[k] = true;}}}}if(dp[max] == true) return true;return false;}}