← All problemsSign in

Dividing into Regions

ChefLand develops very fast. Recently, there were a few new cities built, so the total number of cities in ChefLand have become N. In order to communicate, the cities are connected with N-1 bidirectional roads in such a way that there is exactly one way to get from one city to another. In other words, the graph with cities as nodes and roads as edges is a tree. Now, the King of ChefLand thinks

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

Sign in to chat with the tutor and save your progress.

Sign in to start