Java Program for Smallest K digit number divisible by X Last Updated : 05 Dec, 2018 Summarize Comments Improve Suggest changes Share Like Article Like Report 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. Java // Java code to find smallest K-digit // number divisible by X import java.io.*; import java.lang.*; class GFG { public static double answer(double X, double K) { double i = 10; // Computing MIN double MIN = Math.pow(i, K - 1); // returning ans if (MIN % X == 0) return (MIN); else return ((MIN + X) - ((MIN + X) % X)); } public static void main(String[] args) { // Number whose divisible is to be found double X = 83; double K = 5; System.out.println((int)answer(X, K)); } } // Code contributed by Mohit Gupta_OMG <(0_o)> Output: 10043 To understand Math.pow() function, please refer point 18 of the article : https://www.geeksforgeeks.org/java-lang-math-class-java-set-2/ Please refer complete article on Smallest K digit number divisible by X for more details! Comment More infoAdvertise with us Next Article Java Program for Smallest K digit number divisible by X K kartik Follow Improve Article Tags : Mathematical Java Programs DSA Practice Tags : Mathematical Similar Reads Java Program for Largest K digit number divisible by X Integers X and K are given. The task is to find highest K-digit number divisible by X. Examples: Input : X = 30, K = 3 Output : 990 990 is the largest three digit number divisible by 30. Input : X = 7, K = 2 Output : 98 An efficient solution is to use below formula. ans = MAX - (MAX % X) where MAX i 2 min read 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 num 2 min read 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 : 10Recommended PracticeSmallest K digit number divisible by XTry It! A 4 min read C++ Program for Largest K digit number divisible by X Integers X and K are given. The task is to find highest K-digit number divisible by X. Examples: Input : X = 30, K = 3 Output : 990 990 is the largest three digit number divisible by 30. Input : X = 7, K = 2 Output : 98 An efficient solution is to use below formula. ans = MAX - (MAX % X) where MAX i 1 min read Smallest N digit number divisible by N Given a positive integers N, the task is to find the smallest N digit number divisible by N. Examples: Input: N = 2 Output: 10 Explanation: 10 is the smallest 2-digit number which is divisible by 2. Input: N = 3 Output: 102 Explanation: 102 is the smallest 3-digit number which is divisible by 3. Nai 6 min read Like