最厚的汉堡 - Problema

#14371. 最厚的汉堡

Estadísticas

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

ACM ICPC 正在推出一款厚汉堡。一片牛排的厚度（或高度）为 $A$（$1\le A\le 100$）。一片鸡排的厚度（或高度）为 $B$（$1\le B\le 100$）。

厨师允许在汉堡中加入恰好三片肉，且不允许加入三片相同的肉。作为一名顾客和美食家，你想知道你能从厨师那里得到的汉堡的最大总厚度。这里我们忽略面包、蔬菜和其他调味品的厚度。

输入格式

第一行是测试用例的数量。对于每个测试用例，第一行包含两个正整数 $A$ 和 $B$。

输出格式

对于每个测试用例，输出一行，包含汉堡的最大总厚度。

样例

输入样例 1

输出样例 1

178
71
165

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0