- Related Questions & Answers
- Minimum positive integer divisible by C and is not in range [A, B] in C++
- Find the minimum positive integer such that it is divisible by A and sum of its digits is equal to B in Python
- Minimum positive integer value possible of X for given A and B in X = P*A + Q*B in C++
- Count pairs (i,j) such that (i+j) is divisible by both A and B in C++
- Program to find Nth term divisible by a or b in C++
- Print values of ‘a’ in equation (a+b) <= n and a+b is divisible by x
- Find minimum positive integer x such that a(x^2) + b(x) + c >= k in C++
- Count the numbers divisible by ‘M’ in a given range in C++
- Count of pairs from 1 to a and 1 to b whose sum is divisible by N in C++
- Maximum and Minimum element of a linked list which is divisible by a given number k in C++
- Maximum number of segments of lengths a, b and c in C++
- Add N digits to A such that it is divisible by B after each addition in C++?
- Smallest Integer Divisible by K in Python
- Count numbers in a range that are divisible by all array elements in C++
- Find Positive Integer Solution for a Given Equation in C++

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Here we will see one interesting problem. let us consider we have three integers A, B, and C. We have to find one minimum integer X, such that X mod C = 0, and X is not in the range [A, B]. If the values of A, B and C are 5, 10 and 4 respectively, then the value of X will be 4. We have to follow these steps to get the solution −

**Steps −**

If C is not in the range [A, B], then return C as a result

Otherwise get the first multiple of C, which is greater than B, then return that value

#include <iostream> using namespace std; int findMinMumber(int a, int b, int c) { if (c < a || c > b) return c; int res = ((b / c) * c) + c; return res; } int main() { int a = 2, b = 4, c = 2; cout << "Minimum number X: " << findMinMumber(a, b, c); }

Minimum number X: 6

Advertisements