Cody

# Problem 731. Given a window, how many subsets of a vector sum positive

Solution 334599

Submitted on 16 Oct 2013 by Eric G.
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
%% x = [1 0 -1 3 2 -3 1]; window = 2; y_correct = 3; assert(isequal(sum_positive(x, window),y_correct))

vals = 1 vals = 1 -1 vals = 1 -1 2 vals = 1 -1 2 5 vals = 1 -1 2 5 -1 vals = 1 -1 2 5 -1 -2 y = 3

2   Pass
%% x = [1 0 -1 3 2 -3 1]; window = 3; y_correct = 3; assert(isequal(sum_positive(x, window),y_correct))

vals = 0 vals = 0 2 vals = 0 2 4 vals = 0 2 4 2 vals = 0 2 4 2 0 y = 3

3   Pass
%% x = [1 0 -1 3 2 -3 1]; window = 4; y_correct = 4; assert(isequal(sum_positive(x, window),y_correct))

vals = 3 vals = 3 4 vals = 3 4 1 vals = 3 4 1 3 y = 4

4   Pass
%% x = [1 0 -1 3 2 -3 1 1 1 1 1 1]; window = 2; y_correct = 8; assert(isequal(sum_positive(x, window),y_correct))

vals = 1 vals = 1 -1 vals = 1 -1 2 vals = 1 -1 2 5 vals = 1 -1 2 5 -1 vals = 1 -1 2 5 -1 -2 vals = 1 -1 2 5 -1 -2 2 vals = 1 -1 2 5 -1 -2 2 2 vals = 1 -1 2 5 -1 -2 2 2 2 vals = 1 -1 2 5 -1 -2 2 2 2 2 vals = 1 -1 2 5 -1 -2 2 2 2 2 2 y = 8