Given two positive integers A and B where A is greater than B. In one move one can decrease A by 1 which implies that after one move A is equal to A – 1. The task is to find the minimum number of moves required to make A divisible by B in constant time.
Input : A = 10, B = 3 Output : 1 Explanation: Only one move is required A = A - 1 = 9, which is divisible by 3. Input : A = 10, B = 10 Output : 0 Explanation: Since A is equal to B therefore zero move required.
To solve the problem mentioned above we take the modulus of the numbers that are A % B and the result is stored in a variable which is the required answer.
Below is the implementation of the above approach:
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Minimum positive integer divisible by C and is not in range [A, B]
- Count of m digit integers that are divisible by an integer n
- Maximum positive integer divisible by C and is in the range [A, B]
- Minimum positive integer value possible of X for given A and B in X = P*A + Q*B
- Minimum numbers needed to express every integer below N as a sum
- Count the minimum steps to reach 0 from the given integer N
- Minimum positive integer to divide a number such that the result is an odd
- Minimum integer such that it leaves a remainder 1 on dividing with any element from the range [2, N]
- Minimum integer that can be obtained by swapping adjacent digits of different parity
- Find the minimum sum of distance to A and B from any integer point in a ring of size N
- Minimum number of given moves required to make N divisible by 25
- Minimum operations required to make all Array elements divisible by K
- Minimum swaps required to make a binary string divisible by 2^k
- Minimum number of operations to convert array A to array B by adding an integer into a subarray
- Minimum number of swaps required to make a number divisible by 60
- Blum Integer
- Find whether a given integer is a power of 3 or not
- Replace all ‘0’ with ‘5’ in an input Integer
- Find One's Complement of an Integer
- Convert given integer X to the form 2^N - 1
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.