Cody

# Problem 43. Subset Sum

Solution 1506683

Submitted on 27 Apr 2018 by David Arnold
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))

c = 2 3 5 c = 2 3 2 5 3 5 ans = 3×1 logical array 0 0 1 ans = 3 j = 1 inds = 3 5 ind = 2 j = 2 inds = 3 5 ind = 2 3 c = 2 3 5

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

c = 5 3 2 ans = 3×1 logical array 0 0 1 ans = 2 j = 1 inds = 2 ind = 3 c = 5 3 5 2 3 2 c = 5 3 2

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

c = 2 3 5 c = 2 3 2 5 3 5 c = 2 3 5

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))

c = 1 1 1 1 1 c = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 c = 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 c = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 c = 1 1 1 1 1 ans = logical 1 ans = 1 j = 1 inds = 1 1 1 1 1 ind = 1 2 3 4 5 j = 2 inds = 1 1 1 1 1 ind = 1 2 3 4 5 1 2 3 4 5 j = 3 inds = 1 1 1 1 1 ind = 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 j = 4 inds = 1 1 1 1 1 ind = 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 j = 5 inds = 1 1 1 1 1 ind = 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 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))

c = 1 2 3 4 100 ans = 5×1 logical array 0 0 0 0 1 ans = 100 j = 1 inds = 100 ind = 5 c = 1 2 1 3 1 4 1 100 2 3 2 4 2 100 3 4 3 100 4 100 c = 1 2 3 1 2 4 1 2 100 1 3 4 1 3 100 1 4 100 2 3 4 2 3 100 2 4 100 3 4 100 c = 1 2 3 4 1 2 3 100 1 2 4 100 1 3 4 100 2 3 4 100 c = 1 2 3 4 100

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

c = -7 -3 -2 8 5 c = -7 -3 -7 -2 -7 8 -7 5 -3 -2 -3 8 -3 5 -2 8 -2 5 8 5 c = -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 ans = 10×1 logical array 0 0 0 0 0 0 0 1 0 0 ans = -3 j = 1 inds = -3 -2 5 ind = 2 j = 2 inds = -3 -2 5 ind = 2 3 j = 3 inds = -3 -2 5 ind = 2 3 5 c = -7 -3 -2 8 -7 -3 -2 5 -7 -3 8 5 -7 -2 8 5 -3 -2 8 5 c = -7 -3 -2 8 5