Prime Numbers

CodeChefOpen on judge ↗

Problem description: Find all the Prime Numbers below N value. Give an optimized solution. Input Format: The first and only line of input contains the number N. Output Format: - If there is no Prime Numbers within the N value, Print "NO"(without quotes). - else Print the prime numbers on a single line separated with space. Constraints 1 ≤ N ≤ 105 Example Input: 10 Output: 2 3 5 7

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