Good Students

CodeChefOpen on judge ↗

The students of CSE-B III year are made to stand in a straight line. The faculty decides a pair to be a pair of good students if the height of the $ith$ student is equal to the height of the $jth$ student and $i < j$. Find the number of pairs of Good Students. ### Input - The first line contains an integer $T$, the number of test cases. Then the test cases follow. - Each test case begins with the

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