Cody

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

Solution 1825606

Submitted on 25 May 2019 by Olivia Li
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))

m = 1 m = 1 -1 m = 1 -1 2 m = 1 -1 2 5 m = 1 -1 2 5 -1 m = 1 -1 2 5 -1 -2

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

m = 0 m = 0 2 m = 0 2 4 m = 0 2 4 2 m = 0 2 4 2 0

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

m = 3 m = 3 4 m = 3 4 1 m = 3 4 1 3

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

m = 1 m = 1 -1 m = 1 -1 2 m = 1 -1 2 5 m = 1 -1 2 5 -1 m = 1 -1 2 5 -1 -2 m = 1 -1 2 5 -1 -2 2 m = 1 -1 2 5 -1 -2 2 2 m = 1 -1 2 5 -1 -2 2 2 2 m = 1 -1 2 5 -1 -2 2 2 2 2 m = 1 -1 2 5 -1 -2 2 2 2 2 2