# C++ Program for Smallest K digit number divisible by X

Integers X and K are given. The task is to find the smallest K-digit number divisible by X.

Examples:

Input : X = 83, K = 5 Output : 10043 10040 is the smallest 5 digit number that is multiple of 83. Input : X = 5, K = 2 Output : 10

An **efficient solution** would be :

Compute MIN : smallest K-digit number (1000...K-times) If, MIN % X is 0, ans = MIN else, ans = (MIN + X) - ((MIN + X) % X)) This is because there will be a number in range [MIN...MIN+X] divisible by X.

`// CPP code to find smallest K-digit number ` `// divisible by X ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to compute the result ` `int` `answer(` `int` `X, ` `int` `K) ` `{ ` ` ` `// Computing MIN ` ` ` `int` `MIN = ` `pow` `(10, K - 1); ` ` ` ` ` `// MIN is the result ` ` ` `if` `(MIN % X == 0) ` ` ` `return` `MIN; ` ` ` ` ` `// returning ans ` ` ` `return` `((MIN + X) - ((MIN + X) % X)); ` `} ` ` ` `// Driver ` `int` `main() ` `{ ` ` ` `// Number whose divisible is to be found ` ` ` `int` `X = 83; ` ` ` ` ` `// Max K-digit divisible is to be found ` ` ` `int` `K = 5; ` ` ` ` ` `cout << answer(X, K); ` `} ` |

*chevron_right*

*filter_none*

**Output:**

10043

Please refer complete article on Smallest K digit number divisible by X for more details!

## Recommended Posts:

- Java Program for Smallest K digit number divisible by X
- Smallest K digit number divisible by X
- Smallest n digit number divisible by given three numbers
- C++ Program for Largest K digit number divisible by X
- Java Program for Largest K digit number divisible by X
- Find nth number that contains the digit k or divisible by k.
- Largest K digit number divisible by X
- Sum of n digit numbers divisible by a given number
- Smallest N digit number which is a multiple of 5
- Largest and smallest digit of a number
- Largest N digit number divisible by given three numbers
- Count n digit numbers divisible by given number
- Smallest number with sum of digits as N and divisible by 10^N
- Smallest number divisible by first n numbers
- Smallest N digit number which is a perfect fourth power