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

Solution 1279363

Submitted on 1 Oct 2017 by Informaton

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

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)) ans = 1 1 -1 2 5 -1 -2 ans = 3
2	Pass	x = [1 0 -1 3 2 -3 1]; window = 3; y_correct = 3; assert(isequal(sum_positive(x, window),y_correct)) ans = 1 1 0 2 4 2 0 ans = 3
3	Pass	x = [1 0 -1 3 2 -3 1]; window = 4; y_correct = 4; assert(isequal(sum_positive(x, window),y_correct)) ans = 1 1 0 3 4 1 3 ans = 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)) ans = 1 1 -1 2 5 -1 -2 2 2 2 2 2 ans = 8

Select a Web Site