Given an integer n, the task is to count the numbers having only 1 set bit in the range [0, n].
Input: n = 7
000, 001, 010, 011, 100, 101, 110 and 111 are the binary representation of all the numbers upto 7.
And there are only 3 numbers ( 001, 010 and 100 ) having only 1 set bit.
Input: n = 3
Approach: If k bits are required to represent n then there are k numbers possible as 1 can be positioned at k different positions each time.
Below is the implementation of the above approach
Time Complexity: O(log n)
- Count Odd and Even numbers in a range from L to R
- Count factorial numbers in a given range
- Count numbers in range 1 to N which are divisible by X but not by Y
- Count of numbers from range [L, R] whose sum of digits is Y
- Count the numbers divisible by 'M' in a given range
- Count of all even numbers in the range [L, R] whose sum of digits is divisible by 3
- Count all the numbers in a range with smallest factor as K
- Count of Numbers in Range where the number does not contain more than K non zero digits
- Sum of numbers in a range [L, R] whose count of divisors is prime
- Count numbers with unit digit k in given range
- Count of common multiples of two numbers in a range
- Count numbers in range L-R that are divisible by all of its non-zero digits
- Count numbers from range whose prime factors are only 2 and 3
- Numbers in range [L, R] such that the count of their divisors is both even and prime
- Count of distinct remainders when N is divided by all the numbers from the range [1, N]
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.
Improved By : jit_t