TREE AND QUERIES

CodeChefOpen on judge ↗

You are given a tree with $N$ nodes and $N-1$ edges. The nodes are numbered from $1$ to $N$ and the tree is rooted at $1$ . Every node has a value associated with it. If we consider the simple path between two nodes $u$ and $v$ , then a node in this path is called special if it's value is not coprime with the value of $lca(u,v)$. Here $lca(u,v)$ means the lowest common ancestor of $u$ and $

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