Factor Tree
CodeChefOpen on judge ↗
Chef lives in a country called ChefLand. The country can be represented as a tree of $N$ cities (numbered $1$ through $N$) connected by $N-1$ roads. For each valid $i$, the cost of a house in city $i$ is $A_i$. You should answer $Q$ queries. In each query, you are given cities $u$ and $v$ (possibly identical); Chef is planning to buy houses in these cities. Chef's *happiness quotient* is equal
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.
Sign in to chat with the tutor and save your progress.
Sign in to start