Tom And Jerry

CodeChefOpen on judge ↗

Tom and Jerry are living in a country with **N** cities numbered from **1 to N**. Each city in the country has a integer code assigned to it. These cities are connected by a system of **N-1** roads. **The city 1 is the capital city. In other words the country is a tree rooted at 1**. Tom lives in city **u** and Jerry in city **v**. One day Tom and Jerry planned to have a business deal at city **w*

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