Is Sum Possible

CodeChefOpen on judge ↗

You are given an array $A$ of $n$ integers as input. Also, you are given an integer $q$, the number of queries. In each query, you will be given an integer $x$, and you have to output the number of sub-arrays of $A$, having sum, exactly equal to $x$. ###Input: - First line will contain $n$, the number of elements of array. - Second line will contain array $A$ of $n$ integers. - Third line

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