Singular prime problem

CodeChefOpen on judge ↗

Aakash is very curious about numbers. One day, he was feeling bored so he decided to make a program to find all the prime numbers between L and U, Which he successfully did. Now, he notes that there are many numbers with number of digits more than one. So, to make it more challenging he modifies the numbers with number of digits more than one to single digit numbers. To do this he decided to find

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