Chef and Semi-Primes

CodeChefOpen on judge ↗

Chef likes prime numbers. However, there is one thing he loves even more. Of course, it's semi-primes! A *semi-prime number* is an integer which can be expressed as a product of two distinct primes. For example, $15 = 3 \cdot 5$ is a semi-prime number, but $1$, $9 = 3 \cdot 3$ and $5$ are not. Chef is wondering how to check if an integer can be expressed as a sum of two (not necessarily distinc

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