Gajjo and his Playground

CodeChefOpen on judge ↗

Gajjo has a playground where he wants to make a circular path for the runners. There are totally N spots in the ground. Each spot has a particular coordinate Ai(Xi, Yi) with reference to the centre of the field as the origin. For each spot Ai let Aj be the closest spot and Ak be the farthest spot $(1 \leq i,j,k \leq N)$. Taking Ai as a center, two concentric circles are made with radius $AiAj$ and

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