Given a number N, the task is to print the maximum between the sum and multiplication of the digits of the given number until the number is reduced to a single digit.
Note: Sum and multiplication of digits to be done until the number is reduced to a single digit.
Let’s take an example where N = 19,
19 breaks into 1+9=10 then 10 breaks into 1+0=1. 1 is a single digit sum.
Also, 19 breaks into 1*9 = 9. 9 is a single digit multiplication.
So, output is 9 i.e. maximum of 9 and 1.
Input: N = 631 Output: 8 Input: 110 Output: 2
- Check if a number is less than 10 then sum and product will be the same. So, return that number.
- Find the sum of digits repeatedly using Method 2 of Finding sum of digits of a number until sum becomes single digit.
- And, Find the product of digits repeatedly using Method 1 of Finding sum of digits of a number until sum becomes single digit.
- Return maximum of both.
Below is the implementation of above approach:
- Numbers less than N that are perfect cubes and the sum of their digits reduced to a single digit is 1
- Finding sum of digits of a number until sum becomes single digit
- Check whether a number can be expressed as a product of single digit numbers
- Maximum number with same digit factorial product
- Sum of Digits in a^n till a single digit
- Maximum sum and product of the M consecutive digits in a number
- Find the number in a range having maximum product of the digits
- Check whether product of digits at even places is divisible by sum of digits at odd place of a number
- Count positive integers with 0 as a digit and maximum 'd' digits
- Product of given N fractions in reduced form
- Find maximum product of digits among numbers less than or equal to N
- Number of times a number can be replaced by the sum of its digits until it only contains one digit
- Check if the product of digit sum and its reverse equals the number or not
- Find last five digits of a given five digit number raised to power five
- Number of digits in the product of two numbers
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.