Cody

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

Solution 1818317

Submitted on 17 May 2019 by wxy daisy
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))

z = 1 0 z = 1 y = 1 z = 0 -1 z = -1 z = -1 3 z = 2 y = 2 z = 3 2 z = 5 y = 3 z = 2 -3 z = -1 z = -3 1 z = -2

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

z = 1 0 -1 z = 0 z = 0 -1 3 z = 2 y = 1 z = -1 3 2 z = 4 y = 2 z = 3 2 -3 z = 2 y = 3 z = 2 -3 1 z = 0

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

z = 1 0 -1 3 z = 3 y = 1 z = 0 -1 3 2 z = 4 y = 2 z = -1 3 2 -3 z = 1 y = 3 z = 3 2 -3 1 z = 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))

z = 1 0 z = 1 y = 1 z = 0 -1 z = -1 z = -1 3 z = 2 y = 2 z = 3 2 z = 5 y = 3 z = 2 -3 z = -1 z = -3 1 z = -2 z = 1 1 z = 2 y = 4 z = 1 1 z = 2 y = 5 z = 1 1 z = 2 y = 6 z = 1 1 z = 2 y = 7 z = 1 1 z = 2 y = 8