2.2.2---Subset Sums (01)

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

 /*
   ID: ******
   LANG: C++
   PROG: subset
 */
 #include <iostream>
 #include <fstream>
 
 using namespace std;
 
 long result[1000];//存储数字组合的结果实现
 
 int main(){
     ofstream fout ("subset.out");
	 ifstream fin ("subset.in");
     int N,sum;
     fin>>N;
         sum = ( N + 1 ) * N / 2;
         if(sum % 2)
         {
             fout << 0 << endl;
             return 0;
         }
         sum /= 2;
         memset(result ,0 ,sizeof(result));
         result[0] = 1;
         for(int i = 1;i <= N;i ++)
         {
             for(int j = sum;j >= i;j --)
                 result[j] += result[j-i];
         }
         fout << result[sum] / 2 << endl;
     return 0;
 }