QOJ.ac

QOJ

حد الوقت: 2.0 s حد الذاكرة: 256 MB مجموع النقاط: 100

#11937. 差值

الإحصائيات

Alice 一直很擅长数学,但她唯一的弱点是乘法和减法。为了帮助她,Bob 给她出了下面这道题。

Bob 给了她四个正整数。Alice 可以随意改变它们的顺序。她的任务是找到一种排列,记为 $A_1, A_2, A_3, A_4$,使得 $A_1 \times A_2 - A_3 \times A_4$ 的值最大。

输入格式

输入包含多组测试数据,第一行给出一个整数 $t$ ($1 \le t \le 100$),表示测试数据的组数。

接下来 $t$ 行,每行包含四个用空格分隔的整数。

所有整数均为正整数且不超过 $100$。

输出格式

对于每组测试数据,输出一行,包含一个整数,即 $A_1 \times A_2 - A_3 \times A_4$ 的最大值。

样例

样例输入 1

5
1 2 3 4
2 2 2 2
7 4 3 8
100 99 98 97
100 100 1 2

样例输出 1

10
0
44
394
9998

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:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.