for _ in range(int(input())):
a, b = sorted([int(i) for i in input().split(' ')])
print((2 * a)**2) if 2 * a > b else print(b**2)#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
int a, b, area;
while(t--){
cin >> a >> b;
if(b <= a){
if(2 * b < a){
area = a * a;
}
else{
area = 4 * b * b;
}
}
else{
if(2 * a < b){
area = b * b;
}
else{
area = 4 * a * a;
}
}
cout << area << endl;
}
return 0;
}MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |