Find Steps

CodeChefOpen on judge ↗

You are provided a number $N$. In one step, you can either divide $N$ by $6($if $N%6$ is $0)$ or multiply $N$ by $2$ . Find the minimum number of steps required to get $1$ from $N$ or check if it is not possible. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - The only line of the test case contains a number $N$ . ###Output: For each test c

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