Given an Integer N. The task is count numbers P less than N such that P is a product of two distinct perfect squares.
Input : N = 36 Output : 5 Numbers are 4 = 12 * 22, 9 = 12 * 32, 16 = 12 * 42, 25 = 12 * 52, 36 = 12 * 62 Input : N = 1000000 Output : 999
Approach: Let us consider a number P = (a2 * b2) such that P <= N. So we have (a2 * b2) <= N. This can be written as (a * b) <= sqrt(N).
So we have to count pairs (a, b) such that (a * b) <= sqrt(N) and a <= b.
Let us take a number Q = (a * b) such that Q <= sqrt(N).
Taking a = 1, we have b = sqrt(N) – 1 numbers such that, ( a * b = Q <= sqrt(N)).
Thus we can have all sqrt(N) – 1 numbers such that (a2 * b2) <= N.
Below is the implementation of the above approach:
Time Complexity: O(log(N))
- Number of perfect squares between two given numbers
- Count all perfect divisors of a number
- Count number of squares in a rectangle
- Count numbers upto N which are both perfect square and perfect cube
- Smallest and Largest N-digit perfect squares
- Largest sub-array whose all elements are perfect squares
- Check if the sum of perfect squares in an array is divisible by x
- Count the total number of squares that can be visited by Bishop in one move
- Program to count number of distinct Squares and Cubes upto N
- Sort perfect squares in an array at their relative positions
- Sum of distances between the two nearest perfect squares to all the nodes of the given linked list
- Count number of triplets with product equal to given number with duplicates allowed
- Count number of ordered pairs with Even and Odd Product
- Count number of trailing zeros in product of array
- Check if product of array containing prime numbers is a perfect square
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.