Alice And Subarray

CodeChefOpen on judge ↗

You are friend of Alice so you solve assignment of Alice as all friend solve assignment of other. Question of assignment be like :- There is an array $Arr[]$ of $N$ element . Print the distinct number of subarray sum possible. ### Input -It contains of a two lines of input, 1st line contains value of $N$ ,than in 2nd line it contains n elements of array $Arr[]$. ### Output For each testcase

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