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)
- Smallest integer with digit sum M and multiple of N
- Smallest K digit number divisible by X
- Smallest n digit number divisible by given three numbers
- C++ Program for Smallest K digit number divisible by X
- Check if the first and last digit of the smallest number forms a prime
- Java Program for Smallest K digit number divisible by X
- Smallest multiple of 3 which consists of three given non-zero digits
- Count of Numbers in Range where first digit is equal to last digit of the number
- Smallest and Largest N-digit perfect cubes
- Smallest and Largest N-digit perfect squares
- Smallest integer greater than n such that it consists of digit m exactly k times
- Largest number less than N with digit sum greater than the digit sum of N
- n'th multiple of a number in Fibonacci Series
- Round the given number to nearest multiple of 10
- Check if a number is multiple of 5 without using / and % operators
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.