Cody

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

Given a vector:

[1 0 -1 3 2 -3 1]

and a window of 2,

A sliding window would find:

   1 + 0 =  1
   0 - 1 = -1
  -1 + 3 =  2
   3 + 2 =  5
   2 - 3 = -1
  -3 + 1 = -2

Meaning that three of the windows were positive.

Given a vector and a window, how many of the windows sum to be positive, not zero or negative?

Solve

Solution Stats

43.04% Correct | 56.96% Incorrect
Last Solution submitted on Jan 09, 2020

Problem Comments

Solution Comments

Problem Recent Solvers680

Suggested Problems

More from this Author52

Problem Tags

asee good