Minimum Distance

CodeChefOpen on judge ↗

Chef is fond of candy. Chef's sister has $N$ candies for chef, but She don't want to give those candies to chef hand's because of Chef's Laziness. As Chef is very lazy. So, His sister placed those candies to some $(x,y)$ coordinate of grid dimensions $L X M$ where $L$ denotes the number of rows and M is the number of columns. Chef has decided to pick only one candy among those $N$. So, In $one mo

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