Given a number n and a value k. From the right, set the kth bit in the binary representation of n. The position of LSB(or last bit) is 0, second last bit is 1 and so on. Also, 0 <= k < x, where x is the number of bits in the binary representation of n.
Input : n = 10, k = 2 Output : 14 (10)10 = (1010)2 Now, set the 2nd bit from right. (14)10 = (1110)2 2nd bit has been set. Input : n = 15, k = 3 Output : 15 3rd bit of 15 is already set.
To set any bit we use bitwise OR | operator. As we already know bitwise OR | operator evaluates each bit of the result to 1 if any of the operand’s corresponding bit is set (1). In-order to set kth bit of a number we need to shift 1 k times to its left and then perform bitwise OR operation with the number and result of left shift performed just before.
In general, (1 << k) | n.
Kth bit set number = 14
This article is contributed by Ayush Jauhari. 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 write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Maximize a given unsigned number number by swapping bits at it's extreme positions.
- Count number of trailing zeros in Binary representation of a number using Bitset
- Check if the binary representation of a number has equal number of 0s and 1s in blocks
- Find a number which give minimum sum when XOR with every number of array of integers
- Minimum number of given powers of 2 required to represent a number
- Number of leading zeros in binary representation of a given number
- Check if a number has same number of set and unset bits
- Find the Number Occurring Odd Number of Times
- Minimum number using set bits of a given number
- Find third number such that sum of all three number becomes prime
- M-th smallest number having k number of set bits.
- Number of pairs with Bitwise OR as Odd number
- Number of integers with odd number of set bits
- Next higher number with same number of set bits
- Number whose XOR sum with given array is a given number k