Cody

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

Solution 334602

Submitted on 16 Oct 2013 by Eric G.
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

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

y = 3

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

y = 3

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

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

y = 8

Suggested Problems

More from this Author52