Jumping Jack

CodeChefOpen on judge ↗

Given a starting position on the number line $K$, and two jump sizes $D1$ and $D2$, find the minimum number of jumps needed to reach a given number $X$ on the number line. If not possible, output $-1$. At any position on the number line, we are allowed to jump to $P + D1$, $P – D1$, $P + D2$, or $P – D2$ ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. -

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