Package g3201_3300.s3233_find_the_count_of_numbers_which_are_not_special

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3233 - Find the Count of Numbers Which Are Not Special.

    Medium

    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, r] that are not special.

    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:

    • <code>1 <= l <= r <= 10<sup>9</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer nonSpecialCount(Integer l, Integer r)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait