Long Drive

CodeChefOpen on judge ↗

The country of Byteland has N cities. There are roads across certain pair of cities. There are exactly N-1 such roads. The roads are such that it is possible to go from any city to any other city using those N-1 roads. One day Little chef and his brother Big chef decided to have a car race. Choosing the starting city and destination city was a big problem. Finally they settled with the following

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