COINS

CodeChefOpen on judge ↗

Our *Farzi Coder* likes *Mota Chuha* a lot, as he runs very fast and catching him is not only hard, but also impossible. The city is in the form of a tree (Graph Theory Tree), with **N** junctions with exactly one follower of *Farzi Coder* in each. There are **N-1** bidirectional roads connecting these junctions such that there is exactly one distinct path between any pair of junctions. Now *Far

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