Bond of Friendship

CodeChefOpen on judge ↗

Jai and Veeru have now established their headquarters at different cities. Now they want to form a network, they want that all their headquarters should be reachable from every headquarter. One headquarter is reachable from other headquarter if there is a road connecting headquarters. Headquarters are suppose based on a 2-D plane having integral coordinates. Cost of building roads between two h

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