Final Score

CodeChefOpen on judge ↗

There are two friends named Tanmay and Aditya. They have formed a team and have taken part in a competition organised by CodeChef-VIT. They are given $T$ points on a plane. The $i$-th point is located at $(Xi,Yi)$. They have to calculate the distance between every possible pair of points given to them. The formula used for finding distance between two points $i$ and $j$ by Tanmay is ![image](

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