Gi-Hun and Magical Numbers

CodeChefOpen on judge ↗

Gi-Hun loves to solve maths problem .He calls a number 'magical' when the count of divisors of the number are prime as well as odd. He has been challenged by his friend who has given him a number 'N' and asking to find out the count of magical numbers for the range [1,N]. Gi-Hun is stuck and asking you for the help. ### Input - First line will contain $T$, number of testcases. Then the testcases

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