We are given two numbers n and m, and two-bit positions, i and j. Insert bits of m into n starting from j to i. We can assume that the bits j through i have enough space to fit all of m. That is, if m = 10011, you can assume that there are at least 5 bits between j and i. You would not, for example, have j = 3 and i = 2, because m could not fully fit between bit 3 and bit 2.
Input : n = 1024 m = 19 i = 2 j = 6; Output : n = 1100 Binary representations of input numbers m in binary is (10011)2 n in binary is (10000000000)2 Binary representations of output number (10000000000)2 Input : n = 5 m = 3 i = 1 j = 2 Output : 7
1. Clear the bits j through i in n 2. Shift m so that it lines up with bits j through i 3. Return Bitwise AND of m and n.
The trickiest part is Step 1. How do we clear the bits in n? We can do this with a mask. This mask will have all 1s, except for 0s in the bits j through i. We create this mask by creating the left half of the mask first, and then the right half.
Following is the implementation of the above approach.
1100 // in Binary (10001001100)2
This article is contributed by Mr. Somesh Awasthi. 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 write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Inserting M into N such that m starts at bit j and ends at bit i | Set-2
- Queries to find the count of integers in a range that contain the given pattern
- Count of N-bit binary numbers without leading zeros
- Maximum distance between two 1's in Binary representation of N
- Maximize the Expression | Bit Manipulation
- Find the possible permutation of the bits of N
- Find the maximum possible Binary Number from given string
- Count of elements which are equal to the XOR of the next two elements
- Find third number such that sum of all three number becomes prime
- Array containing power of 2 whose XOR and Sum of elements equals X
- Number of triplets in array having subarray xor equal
- Queries to check whether all the elements in the given range occurs even number of times
- Count total set bits in all numbers from 1 to N | Set 3
- Count total unset bits in all the numbers from 1 to N
Improved By : jit_t