Given a number. The task is to count the number of Trailing Zero in Binary representation of a number using bitset.
Input : N = 16 Output : 3 Binary representation of N is 1000. Therefore, number of zeroes at the end is 3. Input : N = 8 Output : 2
Approach: We simply set the number in the bitset and then we iterate from 0 index of bitset, as soon as we get 1 we will break the loop because there is no trailing zero after that.
Below is the implementation of above approach:
- Count number of trailing zeros in (1^1)*(2^2)*(3^3)*(4^4)*..
- Count number of trailing zeros in product of array
- Number of leading zeros in binary representation of a given number
- Number of trailing zeros in N * (N - 2) * (N - 4)*....
- Find the smallest number X such that X! contains at least Y trailing zeros.
- Smallest number divisible by n and has at-least k trailing zeros
- Number of trailing zeroes in base B representation of N!
- Count unique numbers that can be generated from N by adding one and removing trailing zeros
- Check if the binary representation of a number has equal number of 0s and 1s in blocks
- Count trailing zeroes in factorial of a number
- Count number of set bits in a range using bitset
- Count number of common elements between two arrays by using Bitset and Bitwise operation
- Binary representation of a given number
- Binary representation of previous number
- Largest number with binary representation is m 1's and m-1 0's
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 : mohit kumar 29