Given a range L and R count all numbers between L to R such that sum of digit of each number and sum of square of digit of each number is Prime.
Note: 10 <= [L, R] <= 108
Input: L = 10, R = 20
Such types of numbers are: 11 12 14 16
Input: L = 100, R = 130
Such types of numbers are : 101 102 104 106 110 111 113 119 120
Just get the sum of digit of each number and sum of the square of digit of each number and to check whether they both are prime or not.
In this approach, there is an observation that can do the optimization:
- Now if look closely into range the number is 108 ie., and largest number less than this will be 99999999 and maximum number can be formed is 8 * ( 9 * 9 ) = 648 (as the sum of digit square is 92 + 92 + … 8times) so we need only primes upto 648 only which can be done using Sieve of Eratosthenes.
- Now iterate for each number in the range and check whether it satisfies above condition or not.
Below is the implementation of the above approach:
If there are multiple queries asked to find out numbers between range from L and R there will be 2 approaches:
- Store all number which satisfies above condition in another array and use binary search to find out how many elements in array such that it less than R , say cnt1 , and how many elements in array such that it less than L , say cnt2 . Return cnt1 – cnt2
Time Complexity: O(log(N)) per query.
- We can use prefix array or DP approach such that it already stores how many no. are good of above type from index 0 to i, and return total count by giving DP[R] – DP[L-1]
Time Complexity: O(1) per query.
- Find the highest occurring digit in prime numbers in a range
- Count of Numbers in Range where first digit is equal to last digit of the number
- Count of Numbers in a Range where digit d occurs exactly K times
- Count of Numbers in a Range divisible by m and having digit d in even positions
- Check if the first and last digit of number N is prime and their sum is less than K
- Queries to check whether a given digit is present in the given Range
- Queries for the smallest and the largest prime number of given digit
- Check if the first and last digit of the smallest number forms a prime
- Integers from the range that are composed of a single distinct digit
- Shortest path to reach one prime to other by changing single digit at a time
- Composite numbers with digit sum 1
- Print all n-digit strictly increasing numbers
- Check whether a number can be expressed as a product of single digit numbers
- Check if product of array containing prime numbers is a perfect square
- Prime numbers in a given range using STL | Set 2
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.