Equal Difference

CodeChefRating 979Open on judge ↗

You are given an array $A$ of $N$ integers. Count the number of pairs $(i, j)$ such that: - $1 \le i < j \le N$ - $A_i - A_j = i - j$ ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of multiple lines of input. - The first line contains an integer $N$ - the size of the array. - The second line contains $N

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