Given an integer N, the task is to find two positive integers A and B such that A + B = N and the sum of digits of A and B is minimum. Print the sum of digits of A and B.
Input: N = 16
(10 + 6) = 16 and (1 + 0 + 6) = 7
is minimum possible.
Input: N = 1000
(900 + 100) = 1000
Approach: If N is a power of 10 then the answer will be 10 otherwise the answer will be the sum of digits of N. It is clear that the answer can not be smaller than the sum of digits of N because the sum of digits decreases whenever a carry is generated. Moreover, when N is a power of 10, obviously the answer can not be 1, so the answer will be 10. Because A or B can not be 0 as both of them must be positive numbers.
Below is the implementation of the above approach:
- Minimize the number by changing at most K digits
- Numbers of Length N having digits A and B and whose sum of digits contain only digits A and B
- Check whether product of digits at even places is divisible by sum of digits at odd place of a number
- Maximize the given number by replacing a segment of digits with the alternate digits given
- Count of numbers between range having only non-zero digits whose sum of digits is N and number is divisible by M
- Minimum number of digits to be removed so that no two consecutive digits are same
- Find the average of k digits from the beginning and l digits from the end of the given number
- Count numbers in given range such that sum of even digits is greater than sum of odd digits
- Numbers with sum of digits equal to the sum of digits of its all prime factor
- Check if the sum of digits of number is divisible by all of its digits
- Smallest number with given sum of digits and sum of square of digits
- Minimize the value of N by applying the given operations
- Minimize the sum of the array according the given condition
- Minimize the cost of buying the Objects
- Minimize the cost to split a number
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.