Cody

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

Solution 775007

Submitted on 10 Nov 2015 by naveen sarigala
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))

sum = 1 sum = -1 sum = 2 sum = 5 sum = -1 sum = -2 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))

sum = 0 sum = 2 sum = 4 sum = 2 sum = 0 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))

sum = 3 sum = 4 sum = 1 sum = 3 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))

sum = 1 sum = -1 sum = 2 sum = 5 sum = -1 sum = -2 sum = 2 sum = 2 sum = 2 sum = 2 sum = 2 y = 8