Given two integers X and Y. X and Y represent any two values among (A + B), (A + C) and (B + C). The task is to find A, B and C such that A + B + C is minimum possible.
Input: X = 3, Y = 4
Output: 2 1 2
A = 2, B = 1, C = 2.
Then A + B = 3 and A + C = 4.
A + B + C = 5 which is minimum possible.
Input: X = 123, Y = 13
Output: 1 12 111
Approach: Let X = A + B and Y = B + C. If X > Y let’s swap them. Note that A + B + C = A + B + (Y – B) = A + Y. That’s why it’s optimal to minimize the value of A. So the value of A can always be 1. Then B = X – A and C = Y – B.
Below is the implementation of the above approach:
1 12 111
- Find the minimum value of m that satisfies ax + by = m and all values after m also satisfy
- Maximum and Minimum Values of an Algebraic Expression
- Minimum length String with Sum of the alphabetical values of the characters equal to N
- Minimize the difference between the maximum and minimum values of the modified array
- Find smallest values of x and y such that ax - by = 0
- Find the values of X and Y in the Given Equations
- Find the sum of the ascii values of characters which are present at prime positions
- Find minimum x such that (x % k) * (x / k) == n | Set-2
- Find minimum x such that (x % k) * (x / k) == n
- Find the value of N when F(N) = f(a)+f(b) where a+b is the minimum possible and a*b = N
- Find the minimum value of X for an expression
- Find minimum sum of factors of number
- Find two numbers with the given LCM and minimum possible difference
- Find the minimum possible health of the winning player
- Find minimum number of coins that make a given value
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.