Make It One
Chef is given a positive integer $N$ and we have to convert it to $1$ using some operations. $\newline$ In one operation, Chef can do the following: $\newline$ - Choose a [prime number](https://en.wikipedia.org/wiki/Prime_number) $p$ such that $p$ $|$ $N$ $(p$ divides $N)$. - Replace $N$ with $\frac{N}{p}$. However, Chef is also given some *triggers* of the form $(a,b)$ ($a$ is prime). Thus, if
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.
Sign in to chat with the tutor and save your progress.
Sign in to start