Find the Count of Numbers Which Are Not Special - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
3233. Find the Count of Numbers Which Are Not Special
Medium
30 Points
Array
Math
Number Theory
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:
Return the count of numbers in the range [l, r] that are not special.
Examples
Example 1
Input: l = 5, r = 7
Output: 3
Explanation:
There are no special numbers in the range [5, 7] .
Example 2
Input: l = 4, r = 16
Output: 11
Explanation:
The special numbers in the range [4, 16] are 4 and 9.
Constraints
1 <= l <= r <= 109
3233. Find the Count of Numbers Which Are Not Special
Medium
30 Points
Array
Math
Number Theory
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:
Return the count of numbers in the range [l, r] that are not special.
Examples
Example 1
Input: l = 5, r = 7
Output: 3
Explanation:
There are no special numbers in the range [5, 7] .
Example 2
Input: l = 4, r = 16
Output: 11
Explanation:
The special numbers in the range [4, 16] are 4 and 9.