Cody

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

Solution 431948

Submitted on 15 Apr 2014 by Joel
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))

b = 0 c = 1 y = 0 positive = 1 y = 1 positive = -1 positive = 2 y = 2 positive = 5 y = 3 positive = -1 positive = -2

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

b = 0 c = 1 y = 0 positive = 0 positive = 2 y = 1 positive = 4 y = 2 positive = 2 y = 3 positive = 0

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

b = 0 c = 1 y = 0 positive = 3 y = 1 positive = 4 y = 2 positive = 1 y = 3 positive = 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))

b = 0 c = 1 y = 0 positive = 1 y = 1 positive = -1 positive = 2 y = 2 positive = 5 y = 3 positive = -1 positive = -2 positive = 2 y = 4 positive = 2 y = 5 positive = 2 y = 6 positive = 2 y = 7 positive = 2 y = 8