Given three positive integers A, B and C. The task is to find the minimum integer X > 0 such that:
- X % C = 0 and
- X must not belong to the range [A, B]
Input: A = 2, B = 4, C = 2
Input: A = 5, B = 10, C = 4
- If C doesn’t belong to [A, B] i.e. C < A or C > B then C is the required number.
- Else get the first multiple of C greater than B which is the required answer.
Below is the implementation of the above approach:
- 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 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 elements to be added in a range so that count of elements is divisible by K
- Print first k digits of 1/n where n is a positive integer
- Count of m digit integers that are divisible by an integer n
- Minimum Possible sum of digits in a positive multiple of N
- Biggest integer which has maximum digit sum in range from 1 to n
- Minimum number of changes such that elements are first Negative and then Positive
- Sum of all numbers divisible by 6 in a given range
- Count numbers in range 1 to N which are divisible by X but not by Y
- Count the numbers divisible by 'M' in a given range
- Numbers that are not divisible by any number in the range [2, 10]
- Check if there is any pair in a given range with GCD is divisible by k
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.