CAKE-HOP

CodeChefOpen on judge ↗

You are given an array $A$ of $N$ integers, $A$$1$$,$ $A$$2$ $......$ $,$ $A$$N$ Count the number of triplets $(i,j,k)$ such that - $A$$i$ $+$ $A$$j$ $=$ $A$$k$ $,$ - $1 \leq i , j $th$ element of the Array ###Output: - For each test case, print the number of valid Triplets in a new line. ###Constraints: - $1 \leq T \leq 10$ - $3 \leq N \leq 50000$ - $0 \leq$ $A$$i$ $\leq 1000$ ###Subtasks: -

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