Description: Subset of the problem and an example for < S,t> . Of which, S = (x1, x2, ..., xn) is a set of positive integers, c is a positive integer. And problems in a subset of S to determine whether there is a subset of S1, made of elements in S1 and the mean c, subset of the design of a solution of the backward algorithm and issues. Input: 2 Number of the first line, n (set size S) and c (sub-sets and the target) that the second line of n number of output elements of the collection: no solution when the output of his " No Solution! ↵ " (the middle of a space) to solve subset when the elements of output such as: input : 51,022,654 output 2 2 6
To Search:
- [WorkDistribute] - Work distribution, n of n individuals to
- [SubsetSum] - Subset of the problem and an example for
- [source] - Subset of the problem and the realizatio
File list (Check if you may need any files):
子集和问题.cpp
子集和问题.txt
Download