← All problemsSign in

Chipped Tree

CodeChefRating 2011Open on judge ↗

You are given a tree with $N$ nodes, which are numbered from $1$ to $N$. It is rooted at Node $1$. We define a single $operation$ as follows :- - Put a chip on the root. - Within an operation, you can "move" as many times as you like. - A move is defined as picking a node which has a chip on it and then removing the chip from that node and placing a chip on all of its children. A node is covere

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