OneTwo

CodeChefRating 2149Open on judge ↗

For her birthday, Rima got an integer sequence $A_1, A_2, \dots, A_N$. Each element of this sequence is either 1 or 2. Let's call an integer $s$ ($1 \le s \le 2N$) a *summary integer* if there is a contiguous subsequence of $A$ such that the sum of its elements is equal to $s$. Rima wants to count all the summary integers. Can you help her? ### Input - The first line of the input contains a sin

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