The Kingdom of Exodiastaan
There was a kingdom 'Exodistaan' ruled by 'JonSnow'. The kingdom was divided into $n$ x $m$ cities. The cities are arranged in a grid, with $n$ rows of $m$ cities each. Now the ruler 'JonSnow' had a list of enemies (not exceeding 10). The enemies want Exodistaan for themselves, as it is quite popular. Their strategy was to first attack the cities row-wise and then attack column-wise. The enemies a
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