Given an integer X. The task is to find the smallest positive number Y(> 0) such that X AND Y is zero.
Input : X = 3
Output : 4
4 is the samllest positive number whose bitwise AND with 3 is zero
Input : X = 10
Output : 1
There are 2 cases :
- If the binary representation of X contains all 1s, in that case, all the bits of Y should be 0 to make the result of AND operation is zero. Then X+1 is our answer which is the first positive integer.
- If the binary representation of X doesn’t contain all 1s, in that case, find the first position in X at which bit is 0. Then our answer will be power(2, position)
Below is the implementation of the above approach :
- Find the smallest positive number which can not be represented by given digits
- Find the smallest positive number missing from an unsorted array | Set 3
- Find the number of positive integers less than or equal to N that have an odd number of digits
- Find a positive number M such that gcd(N^M, N&M) is maximum
- Find Nth positive number whose digital root is X
- Find subsequences with maximum Bitwise AND and Bitwise OR
- Find number of edges that can be broken in a tree such that Bitwise OR of resulting two trees are equal
- Find the smallest number whose digits multiply to a given number n
- Size of the smallest subset with maximum Bitwise OR
- Find smallest number K such that K % p = 0 and q % K = 0
- Find smallest permutation of given number
- Given a number, find the next smallest palindrome
- Find smallest number n such that n XOR n+1 equals to given k.
- Find the kth smallest number with sum of digits as m
- Find the k-th smallest divisor of a natural number 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 email@example.com. 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.