Cycle Length

CodeChefOpen on judge ↗

Tree is connected acyclic graph. Adding an edge in tree creates a cycle. You are given a tree with n number of vertices and k queries. Each query consists of two numbers a and b. For each query you have to output length of cycle that will be introduced when an edge between vertices a and b is inserted in the tree. It is guaranteed that a and b will not be adjacent in tree. Limits : n Input: Firs

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