Python Program for Smallest K digit number divisible by X
Integers X and K are given. The task is to find 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.
Python3
def answer(X, K):
MIN = pow ( 10 , K - 1 )
if ( MIN % X = = 0 ):
return ( MIN )
else :
return (( MIN + X) - (( MIN + X) % X))
X = 83 ;
K = 5 ;
print (answer(X, K));
|
Output :
10043
Time Complexity: O(logk)
Auxiliary Space: O(1)
Please refer complete article on Smallest K digit number divisible by X for more details!
Last Updated :
14 Mar, 2023
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...