Cody

# Problem 43. Subset Sum

Solution 62727

Submitted on 18 Mar 2012 by Sven
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
%% v = [2, 3, 5]; n = 8; correct = [2, 3]; actual = subset_sum(v, n); assert(isequal(actual, correct))

nck = 2 3 5 ind = Empty matrix: 1-by-0 ind = [] nck = 2 3 2 5 3 5 ind = 2 3

2   Pass
%% v = [5, 3, 2]; n = 2; correct = 3; actual = subset_sum(v, n); assert(isequal(actual, correct))

nck = 5 3 2 ind = 3

3   Pass
%% v = [2, 3, 5]; n = 4; correct = []; actual = subset_sum(v, n); assert(isequal(actual, correct))

nck = 2 3 5 ind = Empty matrix: 1-by-0 ind = [] nck = 2 3 2 5 3 5 ind = Empty matrix: 1-by-0 ind = [] nck = 2 3 5 ind = Empty matrix: 1-by-0 ind = []

4   Pass
%% v = [1, 1, 1, 1, 1]; n = 5; correct = [1, 2, 3, 4, 5]; actual = subset_sum(v, n); assert(isequal(actual, correct))

nck = 1 1 1 1 1 ind = Empty matrix: 1-by-0 ind = [] nck = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ind = Empty matrix: 1-by-0 ind = [] nck = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ind = Empty matrix: 1-by-0 ind = [] nck = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ind = Empty matrix: 1-by-0 ind = [] nck = 1 1 1 1 1 ind = 1 2 3 4 5

5   Pass
%% v = [1, 2, 3, 4, 100]; n = 100; correct = 5; actual = subset_sum(v, n); assert(isequal(actual, correct))

nck = 1 2 3 4 100 ind = 5

6   Pass
%% v = [-7, -3, -2, 8, 5]; n = 0; correct = [2, 3, 5]; actual = subset_sum(v, n); assert(isequal(actual, correct))

nck = -7 -3 -2 8 5 ind = Empty matrix: 1-by-0 ind = [] nck = -7 -3 -7 -2 -7 8 -7 5 -3 -2 -3 8 -3 5 -2 8 -2 5 8 5 ind = Empty matrix: 1-by-0 ind = [] nck = -7 -3 -2 -7 -3 8 -7 -3 5 -7 -2 8 -7 -2 5 -7 8 5 -3 -2 8 -3 -2 5 -3 8 5 -2 8 5 ind = 2 3 5