[Solution] A or B CodeChef Solution | CodeChef Problem Solution 2022

[Solution] A or B CodeChef Solution | CodeChef Problem Solution 2022

There are two problems in a contest.

• Problem A is worth 500$500$ points at the start of the contest.
• Problem B is worth 1000$1000$ points at the start of the contest.

Once the contest starts, after each minute:

• Maximum points of Problem A reduce by 2$2$ points .
• Maximum points of Problem B reduce by 4$4$ points.

Solution Click Below:-  CLICK HERE

It is known that Chef requires X$X$ minutes to solve Problem A correctly and Y$Y$ minutes to solve Problem B correctly.

Find the maximum number of points Chef can score if he optimally decides the order of attempting both the problems.

My very 1st contest! CodeChef Solution

Chess Ratings CodeChef Solution

[Solution] Recent contest problems CodeChef Solution

A or B CodeChef Solution

Closest Vowels CodeChef Solution

Minimize Blocked Roads CodeChef Solution

Input Format

• First line will contain T$T$, number of test cases. Then the test cases follow.
• Each test case contains of a single line of input, two integers X$X$ and Y$Y$ - the maximum points for problems A$A$ and B$B$ at the start of the contest.

Output Format

For each test case, output in a single line, the maximum number of points Chef can score if he optimally decides the order of attempting both the problems.

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 1≤X,Y≤100