Min Steps

CodeChefRating 1953Open on judge ↗

You start with integer $X = 1$. In each step, you can do **exactly one** of the following: - Multiply $X$ by $2$. - Add $D$ to $X$. Find the minimum number of steps to make $X = N$. If it is impossible, print $-1$ instead. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - The first and only line of input contains $2$ integers - $N$ 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