c8kbf and Tree
Chef _c8kbf_ has an unrooted, weighted tree with $N$ nodes, where vertices $u$ and $v$ are connected by an edge with weight $w$. The **value** of the simple path from $x$ to $y$ is defined as the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of the weights of the edges it consists of. Recall that a simple path is a path that does not have repeating vertices. Help Chef _c8k
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