[Java] Subset Sums

Subset Sums
JRM

For many sets of consecutive integers from 1 through N (1 <= N <= 39), one can partition the set into two sets whose sums are identical.

For example, if N=3, one can partition the set {1, 2, 3} in one way so that the sums of both subsets are identical:

• {3} and {1,2}

This counts as a single partitioning (i.e., reversing the order counts as the same partitioning and thus does not increase the count of partitions).

If N=7, there are four ways to partition the set {1, 2, 3, ... 7} so that each partition has the same sum:

• {1,6,7} and {2,3,4,5}
• {2,5,7} and {1,3,4,6}
• {3,4,7} and {1,2,5,6}
• {1,2,4,7} and {3,5,6}

Given N, your program should print the number of ways a set containing the integers from 1 through N can be partitioned into two sets whose sums are identical. Print 0 if there are no such ways.

Your program must calculate the answer, not look it up from a table.

PROGRAM NAME: subset

INPUT FORMAT

The input file contains a single line with a single integer representing N, as above.

SAMPLE INPUT (file subset.in)

7

OUTPUT FORMAT

The output file contains a single line with a single integer that tells how many same-sum partitions can be made from the set {1, 2, ..., N}. The output file should contain 0 if there are no ways to make a same-sum partition.

SAMPLE OUTPUT (file subset.out)

4

/* Use the slash-star style comments or the system won't see your
   identification information */
/*
ID: lincans1
LANG: JAVA
TASK: subset
*/
import java.io.*;
import java.util.*;

public class subset {

	private long count(int n, int sum) {
		Map<Integer, Long> map = new HashMap<>();
		map.put(0, 1L);
		for (int i = 1; i <= n; i++) {
			Map<Integer, Long> tmp = new HashMap<>(map);
			for (int j : tmp.keySet()) {
				map.put(i + j, map.getOrDefault(i + j, 0L) + tmp.get(j));
			}
		}
		return map.get(sum / 2) / 2;
	}

	public subset() throws IOException {
		BufferedReader f = new BufferedReader(new FileReader("subset.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("subset.out")));

		int N = Integer.parseInt(f.readLine());
		int sum = 0;
		for (int i = 1; i <= N; i++) {
			sum += i;
		}

		long ans = 0;
		if (sum % 2 != 0) {
			ans = 0;
		}
		else {
			ans = count(N, sum);
		}
		out.println(ans);
	    out.close();
	    f.close();
	}
	
	public static void main (String [] args) throws IOException {
		new subset();
	}
}