← All problemsSign in

Block Game

CodeChefRating 2286Open on judge ↗

In the magic land, there is a smart but naughty boy Crane. Crane has n houses, and n friends (both numbered from 1 to n). Crane's mother has scheduled a plan for all his friends such that each friend visits each house of Crane exactly once at a different time, i.e., there is at most one friend in any house at any time. But like Crane all his friends are also naughty. Therefore his mother wants

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