Cody

# Problem 43. Subset Sum

Solution 1292045

Submitted on 17 Oct 2017 by Ratchet_Hamster
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))

active = 0 0 5 active = 0 3 0 active = 0 3 5 active = 2 0 0 active = 2 0 5 active = 2 3 0 active = 2 3 5

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

active = 0 0 2 active = 0 3 0 active = 0 3 2 active = 5 0 0 active = 5 0 2 active = 5 3 0 active = 5 3 2

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

active = 0 0 5 active = 0 3 0 active = 0 3 5 active = 2 0 0 active = 2 0 5 active = 2 3 0 active = 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))

active = 0 0 0 0 1 active = 0 0 0 1 0 active = 0 0 0 1 1 active = 0 0 1 0 0 active = 0 0 1 0 1 active = 0 0 1 1 0 active = 0 0 1 1 1 active = 0 1 0 0 0 active = 0 1 0 0 1 active = 0 1 0 1 0 active = 0 1 0 1 1 active = 0 1 1 0 0 active = 0 1 1 0 1 active = 0 1 1 1 0 active = 0 1 1 1 1 active = 1 0 0 0 0 active = 1 0 0 0 1 active = 1 0 0 1 0 active = 1 0 0 1 1 active = 1 0 1 0 0 active = 1 0 1 0 1 active = 1 0 1 1 0 active = 1 0 1 1 1 active = 1 1 0 0 0 active = 1 1 0 0 1 active = 1 1 0 1 0 active = 1 1 0 1 1 active = 1 1 1 0 0 active = 1 1 1 0 1 active = 1 1 1 1 0 active = 1 1 1 1 1

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

active = 0 0 0 0 100 active = 0 0 0 4 0 active = 0 0 0 4 100 active = 0 0 3 0 0 active = 0 0 3 0 100 active = 0 0 3 4 0 active = 0 0 3 4 100 active = 0 2 0 0 0 active = 0 2 0 0 100 active = 0 2 0 4 0 active = 0 2 0 4 100 active = 0 2 3 0 0 active = 0 2 3 0 100 active = 0 2 3 4 0 active = 0 2 3 4 100 active = 1 0 0 0 0 active = 1 0 0 0 100 active = 1 0 0 4 0 active = 1 0 0 4 100 active = 1 0 3 0 0 active = 1 0 3 0 100 active = 1 0 3 4 0 active = 1 0 3 4 100 active = 1 2 0 0 0 active = 1 2 0 0 100 active = 1 2 0 4 0 active = 1 2 0 4 100 active = 1 2 3 0 0 active = 1 2 3 0 100 active = 1 2 3 4 0 active = 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))

active = 0 0 0 0 5 active = 0 0 0 8 0 active = 0 0 0 8 5 active = 0 0 -2 0 0 active = 0 0 -2 0 5 active = 0 0 -2 8 0 active = 0 0 -2 8 5 active = 0 -3 0 0 0 active = 0 -3 0 0 5 active = 0 -3 0 8 0 active = 0 -3 0 8 5 active = 0 -3 -2 0 0 active = 0 -3 -2 0 5 active = 0 -3 -2 8 0 active = 0 -3 -2 8 5 active = -7 0 0 0 0 active = -7 0 0 0 5 active = -7 0 0 8 0 active = -7 0 0 8 5 active = -7 0 -2 0 0 active = -7 0 -2 0 5 active = -7 0 -2 8 0 active = -7 0 -2 8 5 active = -7 -3 0 0 0 active = -7 -3 0 0 5 active = -7 -3 0 8 0 active = -7 -3 0 8 5 active = -7 -3 -2 0 0 active = -7 -3 -2 0 5 active = -7 -3 -2 8 0 active = -7 -3 -2 8 5