【动态规划】【USACO】Subset Sums

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

---

 

描述

对于从1到N (1 <= N <= 39) 的连续整数集合，能划分成两个子集合，且保证每个集合的数字和是相等的。举个例子，如果N=3，对于{1，2，3}能划分成两个子集合，他们每个的所有数字和是相等的：

{3} 和 {1,2}

这是唯一一种分法（交换集合位置被认为是同一种划分方案，因此不会增加划分方案总数）如果N=7，有四种方法能划分集合{1，2，3，4，5，6，7}，每一种分法的子集合各数字和是相等的:

{1,6,7} 和 {2,3,4,5} {注 1+6+7=2+3+4+5}
{2,5,7} 和 {1,3,4,6}
{3,4,7} 和 {1,2,5,6}
{1,2,4,7} 和 {3,5,6}

给出N，你的程序应该输出划分方案总数，如果不存在这样的划分方案，则输出0。程序不能预存结果直接输出（不能打表）。

格式

PROGRAM NAME: subset

INPUT FORMAT:

(file subset.in)

输入文件只有一行，且只有一个整数N

OUTPUT FORMAT:

(file subset.out)

输出划分方案总数，如果不存在则输出0。

 SAMPLE INPUT

7

SAMPLE OUTPUT

4

来自" http://www.nocow.cn/index.php/Translate:USACO/subset"

---

 

终于又见到DP啦~  但是

 

因为数组越界而不过的SB应该去SHI了……

/* ID:sephiro5 LANG:C++ PROG:subset */ #include<stdio.h> unsigned long f[10000]; int n,max; int main(){ freopen("subset.in","r",stdin); freopen("subset.out","w",stdout); scanf("%d",&n); max=((n+1)*n)/2; if (max&1==1){ printf("0/n"); return 0; } max/=2; f[0]=1; for (int i=1;i<=n;++i) for (int j=max;j>=i;--j) f[j]=f[j]+f[j-i]; printf("%u/n",f[max]/2); return 0; }