【題解】Codeforces 1360A. Minimal Square

#include <iostream>
using namespace std;
 
int t, a, b;
 
int main() {
    cin >> t;
    while (t--){
        cin >> a >> b;
        if (a > b) swap(a, b);
        a *= 2;
        cout << max(a, b)*max(a, b) << "\n";
    }
}