Cody

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

Solution 900746

Submitted on 2 Jun 2016 by William Mitchell
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))

count = 0 sum = 0 sum = 1 sum = 1 count = 1 sum = 0 sum = 0 sum = -1 sum = 0 sum = -1 sum = 2 count = 2 sum = 0 sum = 3 sum = 5 count = 3 sum = 0 sum = 2 sum = -1 sum = 0 sum = -3 sum = -2 sum = 0

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

count = 0 sum = 0 sum = 1 sum = 1 sum = 0 sum = 0 sum = 0 sum = -1 sum = 2 count = 1 sum = 0 sum = -1 sum = 2 sum = 4 count = 2 sum = 0 sum = 3 sum = 5 sum = 2 count = 3 sum = 0 sum = 2 sum = -1 sum = 0 sum = 0

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

count = 0 sum = 0 sum = 1 sum = 1 sum = 0 sum = 3 count = 1 sum = 0 sum = 0 sum = -1 sum = 2 sum = 4 count = 2 sum = 0 sum = -1 sum = 2 sum = 4 sum = 1 count = 3 sum = 0 sum = 3 sum = 5 sum = 2 sum = 3 count = 4 sum = 0

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

count = 0 sum = 0 sum = 1 sum = 1 count = 1 sum = 0 sum = 0 sum = -1 sum = 0 sum = -1 sum = 2 count = 2 sum = 0 sum = 3 sum = 5 count = 3 sum = 0 sum = 2 sum = -1 sum = 0 sum = -3 sum = -2 sum = 0 sum = 1 sum = 2 count = 4 sum = 0 sum = 1 sum = 2 count = 5 sum = 0 sum = 1 sum = 2 count = 6 sum = 0 sum = 1 sum = 2 count = 7 sum = 0 sum = 1 sum = 2 count = 8 sum = 0