GCD on Tree

CodeChefOpen on judge ↗

Given a tree with N nodes and N-1 edges, where each edge has a weight associated with it. Gcd(A,B) represents gcd of weights of all the edges in the path from A to B. Len(A,B) is number of edges in path from A to B. You have to find maximum value of Gcd(A,B) * Len(A,B) over all possible pair of nodes A,B. Input - The first line of the input contains an integer T denoting the number of test ca

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