Given a positive integer n, round it to nearest whole number having zero as last digit.
Input : 4722 Output : 4720 Input : 38 Output : 40 Input : 10 Output: 10
Let’s round down the given number n to the nearest integer which ends with 0 and store this value in a variable a.
a = (n / 10) * 10. So, the round up n (call it b) is b = a + 10.
If n – a > b – n then the answer is b otherwise the answer is a.
Below is the implementation of the above approach:
- Round the given number to nearest multiple of 10 | Set-2
- Nearest prime less than given number n
- Nearest greater number by interchanging the digits
- Round-off a number to a given number of significant digits
- Nth number whose sum of digit is multiple of 10
- Number of triplets such that each value is less than N and each pair sum is a multiple of K
- n'th multiple of a number in Fibonacci Series
- Check if a number is multiple of 5 without using / and % operators
- Smallest N digit number which is a multiple of 5
- An efficient way to check whether n-th Fibonacci number is multiple of 10
- Check whether a very large number of the given form is a multiple of 3.
- Write an Efficient Method to Check if a Number is Multiple of 3
- Reduce the number to minimum multiple of 4 after removing the digits
- Nearest element with at-least one common prime factor
- Replace all consonants with nearest vowels in a string
Improved By : jit_t