Distinct Prime Divisors

CodeChefOpen on judge ↗

Prashant is an IIT aspirant. While preparing for his JEE exams, he came across a problem involving numbers and their divisors which is as follows: For a given number, what are its distinct prime divisors? Prashant being a nerd found this problem too easy. So, he wanted to instead find the distinct prime divisors of all numbers less than $N$ that have odd number of divisors. ###Input: The fir

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