- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Maximum positive integer divisible by C and is in the range [A, B] in C++
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
Example
#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); }
Output
Minimum number X: 6
Advertisements
To Continue Learning Please Login
Login with Google