Given an integer N ≥ 1, the task is to find the smallest N digit number which is a multiple of 5.
Input: N = 1
Input: N = 2
Input: N = 3
- If N = 1 then the answer will be 5.
- If N > 1 then the answer will be (10(N – 1)) because the series of smallest multiple of 5 will go on like 10, 100, 1000, 10000, 100000, …
Below is the implementation of the above approach:
Time Complexity: O(1)
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Smallest integer with digit sum M and multiple of N
- Nth number whose sum of digit is multiple of 10
- Smallest K digit number divisible by X
- Largest and smallest digit of a number
- C++ Program for Smallest K digit number divisible by X
- Smallest n digit number divisible by given three numbers
- Check if the first and last digit of the smallest number forms a prime
- Smallest N digit number which is a perfect fourth power
- Java Program for Smallest K digit number divisible by X
- Queries for the smallest and the largest prime number of given digit
- Smallest N digit number whose sum of square of digits is a Perfect Square
- Smallest multiple of 3 which consists of three given non-zero digits
- Smallest multiple of N formed using the given set of digits
- Smallest and Largest sum of two n-digit numbers
- Count of Numbers in Range where first digit is equal to last digit of the number
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.