ACM-ICPC 2017 Asia Urumqi B. The Difference

最新推荐文章于 2023-03-20 12:08:10 发布

多一些不为什么的坚持

最新推荐文章于 2023-03-20 12:08:10 发布

阅读量488

点赞数

分类专栏： CCF

本文链接：https://blog.csdn.net/qq_33193309/article/details/81431022

版权

CCF 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

Alice was always good at math. Her only weak points were multiplication and subtraction. To help her with that, Bob presented her with the following problem.

He gave her four positive integers. Alice can change their order optionally. Her task is to find an order, denoted by A_1,A_2,A_3A1,A2,A3 and A_4A4, with the maximum value of A_1 \times A_2 - A_3 \times A_4A1×A2−A3×A4.

Input

The input contains several test cases and the first line provides an integer t (1 \le t \le 100)t(1≤t≤100) indicating the number of cases.

Each of the following t lines contains four space-separated integers.

All integers are positive and not greater than 100100.

Output

For each test case, output a line with a single integer, the maximum value of A_1 \times A_2 - A_3 \times A_4A1×A2−A3×A4.

样例输入

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

样例输出

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
int main(){
	int t;
	cin>>t;
	for(int i=0;i<t;i++){
		int a[4];
		for(int j=0;j<4;j++) scanf("%d",&a[j]);
		sort(a,a+4);
		printf("%d\n",a[3]*a[2]-a[0]*a[1]);
	}
	return 0;
}