Description: Knapsack problem source. There is a backpack the weight can be placed for the s, the existing n items separately for the weight w [0], w [1 ],...,[ n-1]. Can this problem are n items in a number of select Add Add this backpack allows the weight of the equal and just s. If there is a selection of these requirements, then to solve this knapsack problem otherwise, that no solution of this knapsack problem.
Data entry:
First line: test set the number of m.
The second line: The first test case of the s value.
Third line: the first test case the number of items n.
Fourth line: the first test case of the n items of weight, separated by a space between.
Fifth row: The second test case of the s value.
Sixth line: The second test case the number of items n.
Seventh line: The second test case of the n items of weight, separated by a space between.
... ... ...
The first 2m line: the first m of the s values of test cases.
2m+1 the first line:
To Search:
- [GA] - This procedure is in the MATLAB platform
File list (Check if you may need any files):
9.cpp
Download