Cody

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

Solution 2022717

Submitted on 15 Nov 2019 by Le Cong Hieu
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))

a = 1 0 ans = 1 a = 0 -1 ans = -1 a = -1 3 ans = 2 a = 3 2 ans = 5 a = 2 -3 ans = -1 a = -3 1 ans = -2

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

a = 1 0 -1 ans = 0 a = 0 -1 3 ans = 2 a = -1 3 2 ans = 4 a = 3 2 -3 ans = 2 a = 2 -3 1 ans = 0

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

a = 1 0 -1 3 ans = 3 a = 0 -1 3 2 ans = 4 a = -1 3 2 -3 ans = 1 a = 3 2 -3 1 ans = 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))

a = 1 0 ans = 1 a = 0 -1 ans = -1 a = -1 3 ans = 2 a = 3 2 ans = 5 a = 2 -3 ans = -1 a = -3 1 ans = -2 a = 1 1 ans = 2 a = 1 1 ans = 2 a = 1 1 ans = 2 a = 1 1 ans = 2 a = 1 1 ans = 2