Jumping Spider

CodeChefOpen on judge ↗

Mama Spider & Baby Spider are standing along a track, $N$ units distance apart. Mama Spider can jump a distance of $K$ units and Baby Spider can jump $1$ unit each time. For each jump, both spiders need $1$ second. If both of them start moving towards each other, then what will be the **minimum** time needed by them to meet each other, provided Mama Spider **cannot** jump over Baby Spider? ### In

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