Bomb The Terrorists

CodeChefOpen on judge ↗

There are $n$ terrorists in a square-shaped red alert area of side length 1 unit. You have bombs that kill all the terrorists in a square-shaped region of side length $\dfrac{1}{k}$ unit. Find the maximum integral value of $k$ such that there is at least $1$ bomb that kills at least $m$ terrorists. **Note**: You have to consider all possible arrangements of terrorists in the square-shaped area.

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