Restricted Partition Solver
Description:Given a set of numbers, this program will solve for all subsets whose elements add up to a given number n, and (optionally) whose sizes are between kmin and kmax. These subsets are commonly called partitions of n. A more detailed explanation along with the source code can be found on the QiGuang.NET Wiki.
Step 1:Enter the set of numbers to choose from.
Step 2:Specify the number that the partitions should add up to.
Step 3:(Optionally) specify the minimum and maximum size of the partitions.

Number set to choose from (separate numbers with spaces, commas, and/or line breaks)
Total sum of each partition Find partitions that add up to .
Constraints (min and max sizes of the partitions) (optional) Partitions must have or more numbers. (kmin)
Partitions must have or fewer numbers. (kmax)

Partitions will be displayed here.