Help the Robber

CodeChefOpen on judge ↗

A Robber has decided to rob a colony in Mumbai. After retrieving the map he figured that the colony resembles a tree structure which is undirected and contains $N$ houses. When the Robber started planning he marked the houses from $0$ to $N-1$. Since the colony resembles a tree structure, the houses are connected, there are no cycles within the colony and $N-1$ lanes connecting the houses. The Ro

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