Perfect Trees

CodeChefOpen on judge ↗

You are given a tree of $N$ nodes rooted at 1 and each tree node has a value associated with it. A tree is a connected undirected graph without any cycles. $2$ nodes u and v are said to form a pair if one node is the other node’s descendent and if the product of their values form a $Perfect$ $square$. You are supposed to find the total number of such pairs and also the minimum distance between

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