EOJ-自适应编程学习平台

Given a set of numbers, the partition problem is to find a subset of the numbers that add up to a specific target number. For example, there are two ways to partition the set $\lbrace 1, 3, 4, 5\rbrace$ so that the remaining elements add up to $5$:

1. Select the $1$ and the $4$
2. Select just the $5$

By contrast, there is no way to partition the set $\lbrace 1, 3, 4, 5\rbrace$ to get $11$.

Write a program that enters a target number, and then several integers as elements of the set, and print number of partitions.

For example, print $2$ if $5,1,3,4,5$ are entered (all integers are separated by a blank), and print $0$ if $11,1,3,4,5$ are entered.

5 1 3 4 5

2

11 1 3 4 5

0