Nth number whose sum of digit is multiple of 10
Content Removed
Recommended Posts:
- Smallest N digit number which is a multiple of 5
- Find the largest N digit multiple of N
- Smallest integer with digit sum M and multiple of N
- Min steps to convert N-digit prime number into another by replacing a digit in each step
- Count of Numbers in Range where first digit is equal to last digit of the number
- Find the remainder when First digit of a number is divided by its Last digit
- Last digit of a number raised to last digit of N factorial
- Largest number less than N with digit sum greater than the digit sum of N
- Generate a number such that the frequency of each digit is digit times the frequency in given number
- Find Nth number in a sequence which is not a multiple of a given number
- Number of times a number can be replaced by the sum of its digits until it only contains one digit
- Queries on sum of odd number digit sums of all the factors of a number
- Count the number of occurrences of a particular digit in a number
- Largest number less than N whose each digit is prime number
- n'th multiple of a number in Fibonacci Series
- Check if a number is multiple of 5 without using / and % operators
- Round the given number to nearest multiple of 10
- Number of triplets such that each value is less than N and each pair sum is a multiple of K
- Round the given number to nearest multiple of 10 | Set-2
- Check whether a very large number of the given form is a multiple of 3.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.
- Shortest path in a directed graph by Dijkstra’s algorithm
- Finding Median of unsorted Array in linear time using C++ STL
- Average of Cubes of first N natural numbers
- Longest subarray whose elements can be made equal by maximum K increments
- Print all possible combinations of the string by replacing '$' with any other digit from the string