0SUMRANGE

CodeChefOpen on judge ↗

### Problem Statement We have an integer sequence $A$, whose length is $N$. Find the number of the non-empty **contiguous** subsequences of $A$ whose sum is $0$. Note that we are counting the **ways to take out subsequences**. That is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions. ### Input Input is

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI