adplus-dvertising

Maximise the Tastiness CodeChef Solution

We Are Discuss About CODECHEF SOLUTION

Maximise the Tastiness CodeChef Solution

Maximise the Tastiness CodeChef Solution

Chef is making a dish that consists of exactly two ingredients. He has four ingredients A, B, C and D with tastiness a, b, c, and d respectively. He can use either A or B as the first ingredient and either C or D as the second ingredient.

The tastiness of a dish is the sum of tastiness of its ingredients. Find the maximum possible tastiness of the dish that the chef can prepare.

Input Format

  • The first line of input will contain a single integer¬†T, denoting the number of test cases.
  • The first and only line of each test case contains four space-separated integers¬†a, b, c,¬†and¬†d¬†‚ÄĒ the tastiness of the four ingredients.

Output Format

For each test case, output on a new line the maximum possible tastiness of the dish that chef can prepare.

Constraints

  • 1 \leq T \leq 100
  • 1 \leq a, b, c, d \leq 100

Sample 1:

Input

Output

2
3 5 6 2
16 15 5 4
11
21

Explanation:

Test case 1: Chef can prepare a dish with ingredients B and C with a tastiness of 5+6=11.

Test case 2: Chef can prepare a dish with ingredients A and C with a tastiness of 16+5=21.

SOLUTION

Maximise the Tastiness CodeChef Solution

SOLUTION

Maximise the Tastiness CodeChef Solution

SOLUTION

Yhaa You have done it but next? if YOU Want to Get Others Please Visit Here ScishowEngineer   Then Follow US HERE and Join Telegram.

If You Want To Learn Something New Then Visit Our Official Channel YOUTUBE

Related Posts

One thought on “Maximise the Tastiness CodeChef Solution

  1. Good post. I learn something new and challenging on sites I stumbleupon everyday. It’s always exciting to read content from other authors and practice something from their web sites. |

Leave a Reply

Your email address will not be published.