← All problemsSign in

Special Tree

You are given a tree with $N$ nodes and $N-1$ edges. The nodes are numbered from $1$ to $N$ and every node $i$ has a value denoted by $A[i]$. You can perform the following operation on the tree rooted at some node: - Choose a positive integer $x$, a subtree $S$ and replace $A[i]$ with $A[i]*x$ ; ∀ node $i$ ∈ $S$. A tree **rooted at some node** is called **special** if value of each node is a **

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