God of coins

CodeChefOpen on judge ↗

You live in a village with $N$ houses labelled from $1$ to $N$ connected with $(N-1)$ roads such that every house can be reached from every other house by travelling through the roads. The festival dedicated to the god of coins will go on for $M$ days where the god will rain coins in a particular method. He will select two of his favourite devotee’s houses on a particular day and rain the coins i

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