D - Four Segments

Monocarp wants to draw four line segments on a sheet of paper. He wants the ii-th segment to have its length equal to aiai (1≤i≤41≤i≤4). These segments can intersect with each other, and each segment should be either horizontal or vertical.

Monocarp wants to draw the segments in such a way that they enclose a rectangular space, and the area of that rectangular space should be maximum possible.

For example, if Monocarp wants to draw four segments with lengths 11, 22, 33 and 44, he can do it the following way:

Here, Monocarp has drawn segments ABAB (with length 11), CDCD (with length 22), BCBC (with length 33) and EFEF (with length 44). He got a rectangle ABCFABCF with area equal to 33 that is enclosed by the segments.
Calculate the maximum area of a rectangle Monocarp can enclose with four segments.

Input
The first line contains one integer tt (1≤t≤3⋅1041≤t≤3⋅104) — the number of test cases.

Each test case consists of a single line containing four integers a1a1, a2a2, a3a3, a4a4 (1≤ai≤1041≤ai≤104) — the lengths of the segments Monocarp wants to draw.

Output
For each test case, print one integer — the maximum area of a rectangle Monocarp can enclose with four segments (it can be shown that the answer is always an integer).

Example
Input
4
1 2 3 4
5 5 5 5
3 1 4 1
100 20 20 100
Output
3
25
3
2000
Note
The first test case of the example is described in the statement.

For the second test case, Monocarp can draw the segments ABAB, BCBC, CDCD and DADA as follows:

Here, Monocarp has drawn segments ABAB (with length 55), BCBC (with length 55), CDCD (with length 55) and DADA (with length 55). He got a rectangle ABCDABCD with area equal to 2525 that is enclosed by the segments.

#include <stdio.h>
int main()
{int n,m,t,a[100],k,i,j,c,b,d;scanf("%d",&m); while(~scanf("%d%d%d%d",&a[0],&a[1],&a[2],&a[3])){for(i=0;i<3;i++){for(j=0;j<3-i;j++){if(a[j]>=a[j+1]){t=a[j];a[j]=a[j+1];a[j+1]=t;}}}printf("%d\n",a[0]*a[2]);} return 0;
}

D - Four Segments相关推荐

LeetCode刷题记录10——434. Number of Segments in a String（easy）
LeetCode刷题记录10--434. Number of Segments in a String(easy) 目录 LeetCode刷题记录9--434. Number of Segments ...
codeforces 610D D. Vika and Segments(离散化+线段树+扫描线算法)
题目链接: D. Vika and Segments time limit per test 2 seconds memory limit per test 256 megabytes input s ...
R语言使用ggpubr包的ggdotplot函数可视化水平棒棒糖图（自定义分组数据点色彩、自定义调色板、在两端添加点图的线段segments、整体排序从大到小、自定义数据点的大小、添加数值标签）
R语言使用ggpubr包的ggdotplot函数可视化水平棒棒糖图(自定义分组数据点色彩.自定义调色板.在两端添加点图的线段segments.整体排序从大到小.自定义数据点的大小.添加数值标签) 目录
Codeforces Round #337 (Div. 2) D. Vika and Segments 线段树扫描线
D. Vika and Segments 题目连接: http://www.codeforces.com/contest/610/problem/D Description Vika has an i ...
关于Uri.Segments 属性的理解
public string[] Segments { get; } Segments 属性返回一个字符串数组,该数组包含构成 URI 的绝对路径的"段"(子字符串).通过分析绝对路 ...
lucene正向索引——正向信息，Index – Segments (segments.gen, segments_N) – Field(fnm, fdx, fdt) – Term (tvx, ...
转自:http://www.cnblogs.com/forfuture1978/archive/2009/12/14/1623599.html 上面曾经交代过,Lucene保存了从Index到Segm ...
PAT甲级1104 Sum of Number Segments：[C++题解]数段之和，测试点2爆double，请用long double！！！
文章目录题目分析题目链接题目分析来源:acwing 分析:本题题意比较简单,但是不能仅仅根据定义来算. 本题思路:统计每个数在多少个区间出现过,也就是这个数需要加多少次.共有n个数,其中第i个 ...
poj 1436 zoj 1391 Horizontally Visible Segments (Segment Tree)
ZOJ :: Problems :: Show Problem 1436 -- Horizontally Visible Segments 用线段树记录表面能被看见的线段的编号,然后覆盖的时候同时把能 ...
翻译: Oralce官方文档-- Data Blocks, Extents, and Segments
Data Blocks, Extents, and Segments ...
oracle 12c undo,Oracle 12C新特性-临时UNDO段(Temporary Undo Segments) | 信春哥，系统稳，闭眼上线不回滚！...
在12C版本,为了减少UNDO表空间的使用率及减少REDO和归档日志的产生量,ORACLE推出了临时UNDO段(Temporary Undo Segments)新特性.这个新特性把临时表产生的UNDO ...

D - Four Segments

D - Four Segments相关推荐

最新文章

热门文章