Cody

# Problem 43. Subset Sum

Solution 109774

Submitted on 10 Jul 2012 by Noah
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))

r = 3 r = 3 aa = 3 5 ind = 2 3 cc = 1 2 r = 1

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

r = 3 aa = 2 ind = 3 cc = 1 r = 3 r = 1

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

r = 3 r = 3 r = 1

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

r = 5 r = 10 r = 10 r = 5 r = 1 aa = 1 ind = 5 cc = 5

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

r = 5 aa = 100 ind = 5 cc = 1 r = 10 r = 10 r = 5 r = 1

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

r = 5 r = 10 r = 10 aa = -3 -2 5 ind = 2 3 5 cc = 1 2 3 r = 5 r = 1