Minimize Tree GCD (Hard)

CodeChefRating 3298Open on judge ↗

**This is the hard version of the problem. The only difference between this and the easy version is that here, you're given only $N-1$ elements of $A$, and have to solve the problem for each value of the last element.** Consider a [tree](https://en.wikipedia.org/wiki/Tree_(graph_theory)) on $N$ vertices, with vertex $i$ having the value $A_i$ associated with it. The score of the tree with respe

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