Ding Ding Ding Ding

CodeChefOpen on judge ↗

Ninja land is an infinite 2D grid. Each cell represents a city, which is characterised by a row number and a column number. A bad ninja, nEro, thinks of destroying the ninja land by spreading a virus. He drops the virus in city **$(X, Y)$**. The virus has a unique property: each second, the virus sends a copy of itself to adjacent unaffacted cities. Suppose there are $X$ viruses in one city and $

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