题意:
解法:
将线段按长度排序,那么a[1]*a[3]就是答案.
原理是长和宽取决于短的那条边.
code:
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxm=3e5+5;
int a[maxm];
void solve(){
for(int i=1;i<=4;i++){
cin>>a[i];
}
sort(a+1,a+1+4);
int ans=a[1]*a[3];
cout<<ans<<endl;
}
signed main(){
ios::sync_with_stdio(0);
int T;cin>>T;
while(T--){
solve();
}
return 0;
}