Incremental Jumps

CodeChefOpen on judge ↗

A function $g(n)$ of a number $n$ denotes the number of digits in the number, and a function $f(n)$ denotes the number of digits in the prime factorization of the number $n$. A given number $x$ is special if $f(x)$ = $g(x)$. AK is currently present on point $a$ on the number line, he wants to reach $b$, you have to find the minimum number of steps needed to reach $b$, he will only jump a leng

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