IEEETRIP
CodeChefOpen on judge ↗
Given an array a of n elements, find the number of triplets i, j, k such that $a_j − a_i = a_k − a_j$ and $i < j < k$. ### Input The first line contains a single integer n corresponding to the size of the array. The next line contains n space separated integers which are the elements of the array. ### Output A single integer denoting the answer. ### Constraints - $1 \leq n\leq 2000
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.
Sign in to chat with the tutor and save your progress.
Sign in to start