Magic Pairs

CodeChefRating 1245Open on judge ↗

Alexandra has some distinct integer numbers a1,a2...an. Count number of pairs (i,j) such that: 1≤ i ≤ n 1≤ j ≤ n ai j Input The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.The first line of each test case contains a single integer n denoting the number of numbers Alexandra has. The second line contains n space-separat

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