3233. Find the Count of Numbers Which Are Not Special

LeetCodeArrayMathNumber TheoryOpen on judge ↗

You are given 2 positive integers l and r. For any number x, all positive divisors of x except x are called the proper divisors of x. A number is called special if it has exactly 2 proper divisors. For example: - The number 4 is special because it has proper divisors 1 and 2. - The number 6 is not special because it has proper divisors 1, 2, and 3. Return the count of numbers in the range [l,

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