← All problemsSign in

A Game of Thrones

There are $M$ kings numbered $1$ to $M$ in Easteros. There are $N$ thrones numbered $1$ to $N$. Initially, the first $N$ kings hold the $N$ thrones in any order (it is not necessary that throne $i$ has king $i$) Kings numbered $N+1$ to $M$ each choose a single throne and start attacking in order i.e King $N+1$ attacks a throne, then King $N+2$ (maybe a different throne) and so on till King $M$. E

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