Cody

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

Solution 1133771

Submitted on 4 Mar 2017 by Matteo Raso
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))

window = 1 val = 1 val = 1 next val = 0 val = -1 next val = -1 val = 2 next val = 3 val = 5 next val = 2 val = -1 next val = -3 val = -2 next 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))

window = 2 val = 1 val = 1 val = 0 next val = 0 val = -1 val = 2 next val = -1 val = 2 val = 4 next val = 3 val = 5 val = 2 next val = 2 val = -1 val = 0 next 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))

window = 3 val = 1 val = 1 val = 0 val = 3 next val = 0 val = -1 val = 2 val = 4 next val = -1 val = 2 val = 4 val = 1 next val = 3 val = 5 val = 2 val = 3 next 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))

window = 1 val = 1 val = 1 next val = 0 val = -1 next val = -1 val = 2 next val = 3 val = 5 next val = 2 val = -1 next val = -3 val = -2 next val = 1 val = 2 next val = 1 val = 2 next val = 1 val = 2 next val = 1 val = 2 next val = 1 val = 2 next y = 8