Number Hunt

CodeChefRating 1638Open on judge ↗

Given a positive integer $X$, find the **smallest** positive integer $Y$ satisfying all of the following conditions: - $Y$ should not be a [prime](https://en.wikipedia.org/wiki/Prime_number); - $Y$ should not be a [perfect square](https://en.wikipedia.org/wiki/Square_number); - No [factor](https://en.wikipedia.org/wiki/Divisor) of $Y$ other than $1$ is less than $X$. Note that $Y$ might not fit i

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