Sum the Digits of a Given Number - Python

Python Program for Smallest K digit number divisible by X

Last Updated : 14 Mar, 2023

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

# Python code to find smallest K-digit  
# number divisible by X

def answer(X, K):
    
    # Computing MAX
    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)); 

# Code contributed by Mohit Gupta_OMG <(0_o)>

Output :

Time Complexity: O(logk)

Auxiliary Space: O(1)

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

Sum the Digits of a Given Number - Python

kartik

Improve

Article Tags :

Similar Reads

Python3 Program to Rotate digits of a given number by K

INTRODUCTION:One important point to consider when working with the algorithm to rotate the digits of a given number by k positions is the time complexity.If we were to implement this algorithm using the approach shown in the previous example, the time complexity would be O(n), where n is the number

Python Program to Find Numbers Divisible by Another Number

We are given a list of numbers and a number. We have to find all the numbers in the list that are divisible by the given single number. Examples:Input: list=[8, 14, 21, 36, 43], num=3Output: 21, 36, 57Input: list=[2, 17, 25, 31, 48, 55], num=5Output: 25, 55In this article, we will discuss the differ

Python Program for Check if all digits of a number divide it

Given a number n, find whether all digits of n divide it or not. Examples: Input : 128Output : Yes128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0. Input : 130Output : No We want to test whether each digit is non-zero and divides the number. For example, with 128, we want to test d != 0 && 128 %

Python Program to Subtract K from each digit

Given a list, the task is to write a Python Program to subtract K from each digit, if the element gets below 0, retain 0. Examples: Input : test_list = [2345, 8786, 2478, 8664, 3568, 28], K = 4Output : [1, 4342, 34, 4220, 124, 4]Explanation : In 2345, 4 subtracted from 2 is -2, hence ceiled to 0. He

Sum the Digits of a Given Number - Python

The task of summing the digits of a given number in Python involves extracting each digit and computing their total . For example, given the number 12345, the sum of its digits is 1 + 2 + 3 + 4 + 5 = 15. Using modulo (%)This method efficiently extracts each digit using the modulus (%) and integer di

Python Program to print all the numbers divisible by 3 and 5 for a given number

Given the integer N, the task is to print all the numbers less than N, which are divisible by 3 and 5.Examples : Input : 50Output : 0 15 30 45 Input : 100Output : 0 15 30 45 60 75 90 Approach: For example, let's take N = 20 as a limit, then the program should print all numbers less than 20 which are

Python Program to Find XOR of array elements which are divisible by given number

Given an array arr[] containing integers of size N and a number k, the task is to find the XOR of array elements that are divisible by a given number k in Python.Examples: Input: arr[] = {3, 9, 16, 12, 13, 15} , k = 3Output: 25Explanation: Only 3,9,12,15 are divisible by 3, XOR = 3^9^12^15 = 9Input:

Python Program to Find Sum of First and Last Digit

Given a positive integer N(at least contain two digits). The task is to write a Python program to add the first and last digits of the given number N. Examples: Input: N = 1247 Output: 8 Explanation: First digit is 1 and Last digit is 7. So, addition of these two (1 + 7) is equal to 8.Input: N = 73

Python3 Program to Count rotations which are divisible by 10

Given a number N, the task is to count all the rotations of the given number which are divisible by 10.Examples: Input: N = 10203 Output: 2 Explanation: There are 5 rotations possible for the given number. They are: 02031, 20310, 03102, 31020, 10203 Out of these rotations, only 20310 and 31020 are d

Python - Split Numeric String into K digit integers

Given a String, convert it to K digit integers Input : test_str = '457336', K = 2 Output : [45, 73, 36] Explanation : Divided in 2 digit integers. Input : test_str = '457336', K = 3 Output : [457, 336] Explanation : Divided in 3 digit integers. Method #1 : Using int() + slice + loop In this, we iter