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

其实一开始就觉得是dp，因为是放与不放的问题，太蠢了没有先分析一下时间复杂度，2^38,显然会超时。可以用滚动数组。

/*
ID: des_jas1
PROG: subset
LANG: C++
*/
#include <iostream>
#include <fstream>
#include <string>
#include <string.h>
#include <cmath>
#include <algorithm>
using namespace std;

const int MAXN=1024;
int n,s;
unsigned long int ans[MAXN]; //不用unsigned long n=39时候通不过

int main()
{
	ofstream fout ("subset.out");
    ifstream fin ("subset.in");
	fin>>n;
	s=n*(n+1)/2;
	if(s % 2)
	{
		fout<<0;
	}
	else
	{
		s/=2;
		int i,j;
		ans[0]=1;
		for(i=1;i<=n;i++)//表示加入i的时候，ans[j]共有多少种
			for(j=s;j>=i;j--)//直到j==i，把自己也算进去
				ans[j]+=ans[j-i]; 
		fout<<(ans[s]/2);//1 2 ---3 ; 3 --- 1 2
	}
	fout<<endl;
	fout.close();
	fin.close();
	return 0;
}