Cody

# Problem 43. Subset Sum

Solution 726348

Submitted on 31 Aug 2015 by Ian Riley
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))

bits = 3 count = 1 2 3 bin = 0 0 1 out = 5 bin = 0 1 0 out = 3 bin = 0 1 1 out = 8 ind = 2 3

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

bits = 3 count = 1 2 3 bin = 0 0 1 out = 2 ind = 3

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

bits = 3 count = 1 2 3 bin = 0 0 1 out = 5 bin = 0 1 0 out = 3 bin = 0 1 1 out = 8 bin = 1 0 0 out = 2 bin = 1 0 1 out = 7 bin = 1 1 0 out = 5 bin = 1 1 1 out = 10

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

bits = 5 count = 1 2 3 4 5 bin = 0 0 0 0 1 out = 1 bin = 0 0 0 1 0 out = 1 bin = 0 0 0 1 1 out = 2 bin = 0 0 1 0 0 out = 1 bin = 0 0 1 0 1 out = 2 bin = 0 0 1 1 0 out = 2 bin = 0 0 1 1 1 out = 3 bin = 0 1 0 0 0 out = 1 bin = 0 1 0 0 1 out = 2 bin = 0 1 0 1 0 out = 2 bin = 0 1 0 1 1 out = 3 bin = 0 1 1 0 0 out = 2 bin = 0 1 1 0 1 out = 3 bin = 0 1 1 1 0 out = 3 bin = 0 1 1 1 1 out = 4 bin = 1 0 0 0 0 out = 1 bin = 1 0 0 0 1 out = 2 bin = 1 0 0 1 0 out = 2 bin = 1 0 0 1 1 out = 3 bin = 1 0 1 0 0 out = 2 bin = 1 0 1 0 1 out = 3 bin = 1 0 1 1 0 out = 3 bin = 1 0 1 1 1 out = 4 bin = 1 1 0 0 0 out = 2 bin = 1 1 0 0 1 out = 3 bin = 1 1 0 1 0 out = 3 bin = 1 1 0 1 1 out = 4 bin = 1 1 1 0 0 out = 3 bin = 1 1 1 0 1 out = 4 bin = 1 1 1 1 0 out = 4 bin = 1 1 1 1 1 out = 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))

bits = 5 count = 1 2 3 4 5 bin = 0 0 0 0 1 out = 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))

bits = 5 count = 1 2 3 4 5 bin = 0 0 0 0 1 out = 5 bin = 0 0 0 1 0 out = 8 bin = 0 0 0 1 1 out = 13 bin = 0 0 1 0 0 out = -2 bin = 0 0 1 0 1 out = 3 bin = 0 0 1 1 0 out = 6 bin = 0 0 1 1 1 out = 11 bin = 0 1 0 0 0 out = -3 bin = 0 1 0 0 1 out = 2 bin = 0 1 0 1 0 out = 5 bin = 0 1 0 1 1 out = 10 bin = 0 1 1 0 0 out = -5 bin = 0 1 1 0 1 out = 0 ind = 2 3 5

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!