Count The Prime

CodeChefOpen on judge ↗

Problem description. Semusa wants to generate Prime Number for his cryptosystem. As Prime Numbers are bare-bones of any cryptosystem, Semusa is baffled with his approach in finding the prime numbers and counting the prime numbers between two given integers. As you are a good programmer, he wants your help in counting the number of Prime Numbers between any two given integers x1 and x2 (inclusive

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