Given an unsigned integer x. Round it down to the next smaller multiple of 8 using bitwise operations only.
Input : 35 Output : 32 Input : 40 Output : 40 As 40 is already a multiple of 8. So, no modification is done.
Solution 1: A naive approach to solve this problem using arithmetic operators is :
Let x be the number then,
x = x – (x % 8)
This will round down x to the next smaller multiple of 8. But we are not allowed to use arithmetic operators.
Solution 2: An efficient approach to solve this problem using bitwise AND operation is: x = x & (-8)
This will round down x to the next smaller multiple of 8. The idea is based on the fact that last three bits in a multiple of 8 must be 0,
Below is the implementation of above idea:
Time Complexity: The time complexity of this approach is O(1)
Space Complexity: The space complexity of this approach is O(1)
- Round to next greater multiple of 8
- Immediate Smaller element in an N-ary Tree
- Count smaller values whose XOR with x is greater than x
- Puzzle | 3 cuts to cut round cake into 8 equal pieces
- Largest number smaller than or equal to N divisible by K
- Count numbers (smaller than or equal to N) with given digit sum
- Count smaller numbers whose XOR with n produces greater value
- Previous smaller integer having one less number of set bits
- Closest (or Next) smaller and greater numbers with same number of set bits
- Delete all the nodes from a doubly linked list that are smaller than a given value
- Precision of floating point numbers in C++ (floor(), ceil(), trunc(), round() and setprecision())
- Find the largest multiple of 2, 3 and 5
- Efficiently check whether n is a multiple of 4 or not
- Find the multiple of x which is closest to a^b
- Smallest multiple of 3 which consists of three given non-zero digits
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.