Biggest integer which has maximum digit sum in range from 1 to n
Given a number n, find a number in range from 1 to n such that its sum is maximum. If there are several such integers, determine the biggest of them.
Examples :
Input: n = 100
Output: 99
99 is the largest number in range from
1 to 100 with maximum sum of digits.
Input: n = 48
Output: 48
Explanation:
There are two numbers with maximum
digit sum. The numbers are 48 and 39
Since 48 > 39, it is our answer.
A naive approach is to iterate for all numbers from 1 to n and find out which number has maximum sum of digits. Time complexity of this solution is O(n).
An efficient approach is to iterate from n to 1. Do the following for each digit of current number, if the digit is not zero, reduce it by one and change all other digits to nine to the right of it. If the sum of digits in the resulting integer is strictly greater than the sum of the digits of the current answer, then update the answer with the resulting integer. If the sum of the resulting integer is same as the current answer, then if the resulting integer is more than current answer, update the current answer with the resulting integer.
How to reduce a digit and change all other digits on its right to 9?
Let x be our current number. We can find next number for current digit using below formula. In below formula, b is a power of 10 to represent position of current digit. After every iteration we reduce x to x/10 and change b to b * 10.
We use (x – 1) * b + (b – 1);
This line can further be explained as, if the number is x = 521 and b = 1, then
- (521 – 1) * 1 + (1-1) which gives you 520, which is the thing we need to do, reduce the position number by 1 and replace all other numbers to the right by 9.
- After x /= 10 gives you x as 52 and b*=10 gives you b as 10, which is again executed as (52-1)*(10) + 9 which gives you 519, which is what we have to do, reduce the current index by 1 and increase all other rights by 9.
C++
#include <bits/stdc++.h>
using namespace std;
int sumOfDigits( int a)
{
int sum = 0;
while (a)
{
sum += a % 10;
a /= 10;
}
return sum;
}
int findMax( int x)
{
int b = 1, ans = x;
while (x)
{
int cur = (x - 1) * b + (b - 1);
if (sumOfDigits(cur) > sumOfDigits(ans) ||
(sumOfDigits(cur) == sumOfDigits(ans) &&
cur > ans))
ans = cur;
x /= 10;
b *= 10;
}
return ans;
}
int main()
{
int n = 521;
cout << findMax(n);
return 0;
}
|
Java
import java.io.*;
class GFG {
static int sumOfDigits( int a)
{
int sum = 0 ;
while (a!= 0 )
{
sum += a % 10 ;
a /= 10 ;
}
return sum;
}
static int findMax( int x)
{
int b = 1 , ans = x;
while (x!= 0 )
{
int cur = (x - 1 ) * b + (b - 1 );
if (sumOfDigits(cur) > sumOfDigits(ans) ||
(sumOfDigits(cur) == sumOfDigits(ans) &&
cur > ans))
ans = cur;
x /= 10 ;
b *= 10 ;
}
return ans;
}
public static void main (String[] args)
{
int n = 521 ;
System.out.println(findMax(n));
}
}
|
Python3
def sumOfDigits(a) :
sm = 0
while (a! = 0 ) :
sm = sm + a % 10
a = a / / 10
return sm
def findMax(x) :
b = 1
ans = x
while (x! = 0 ) :
cur = (x - 1 ) * b + (b - 1 )
if (sumOfDigits(cur) > sumOfDigits(ans) or
(sumOfDigits(cur) = = sumOfDigits(ans) and
cur > ans)) :
ans = cur
x = x / / 10
b = b * 10
return ans
n = 521
print (findMax(n))
|
C#
using System;
class GFG {
static int sumOfDigits( int a)
{
int sum = 0;
while (a!=0)
{
sum += a % 10;
a /= 10;
}
return sum;
}
static int findMax( int x)
{
int b = 1, ans = x;
while (x!=0)
{
int cur = (x - 1) * b + (b - 1);
if (sumOfDigits(cur) > sumOfDigits(ans) ||
(sumOfDigits(cur) == sumOfDigits(ans) &&
cur > ans))
ans = cur;
x /= 10;
b *= 10;
}
return ans;
}
public static void Main()
{
int n = 521;
Console.WriteLine(findMax(n));
}
}
|
PHP
<?php
function sumOfDigits( $a )
{
$sum = 0;
while ( $a )
{
$sum += $a % 10;
$a = (int) $a / 10;
}
return $sum ;
}
function findMax( $x )
{
$b = 1; $ans = $x ;
while ( $x )
{
$cur = ( $x - 1) * $b +
( $b - 1);
if (sumOfDigits( $cur ) > sumOfDigits( $ans ) ||
(sumOfDigits( $cur ) == sumOfDigits( $ans ) &&
$cur > $ans ))
$ans = $cur ;
$x = (int) $x / 10;
$b *= 10;
}
return $ans ;
}
$n = 521;
echo findMax( $n );
?>
|
Javascript
<script>
function sumOfDigits(a)
{
var sum = 0;
while (a != 0)
{
sum += a % 10;
a = parseInt(a / 10);
}
return sum;
}
function findMax(x)
{
var b = 1, ans = x;
while (x != 0)
{
var cur = (x - 1) * b + (b - 1);
if (sumOfDigits(cur) >
sumOfDigits(ans) ||
(sumOfDigits(cur) ==
sumOfDigits(ans) &&
cur > ans))
ans = cur;
x = parseInt(x / 10);
b *= 10;
}
return ans;
}
var n = 521;
document.write(findMax(n));
</script>
|
Output :
499
Time complexity : O(m) where m is the number of digits in n.
This article is contributed by Striver.
Last Updated :
18 Sep, 2023
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...