Mogu and his Special Numbers

CodeChefOpen on judge ↗

Mogu will like a number $N$ only if it has the following property: - The number of divisors of N are even. - The number of divisors of N are prime. Given $L$ and $R$, Mogu needs to find the count of numbers between $L$ and $R$ inclusive that follow the above properties. ###Input: - First line of the Input contains an integer $Q$ denoting the number of queries. Each of the next $Q$ lines con

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