City Mapping 2

CodeChefRating 3126Open on judge ↗

Salmon is going on holiday, and he decides to go to Silvermill after taking the advice of his good friend Peanut. Unfortunately, his computer is broken, and so he cannot Google for the map. Silvermill is a city consisting of $N$ road junctions, numbered from $1$ to $N$, and $N-1$ roads. The city is fully connected, meaning it is possible to travel from every road junction to every other road ju

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