Chef and Divisors

CodeChefRating 2932Open on judge ↗

Given an integer N, you can apply a operation on $N$ multiple times(possibly 0). Operation is defined as follows: - Choose a positive integer $K$ such that $K$ has exactly $4$ divisors and $K$ is a divisor of $N$. - Change $N$ to $N/K$. Find the minimum number of divisors possible of the resulting number $N$. ### Input: - The first line of the input contains a

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