Submission

Score: 0

User: C12

Problemset: anna

Language: cpp

Time: 0.003 second

Submitted On: 2025-12-30 22:00:32

#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pii pair<ll,ll>
#define puii pair<ull,ull>
#define piii pair<ll,pii>
#define ll long long
#define ull unsigned long long
#define mp make_pair
 
#define mpiii(a,b,c) make_pair(a,make_pair(b,c));
ll mod = 1000000007;

bool check[5] = {0};

ll num[5];
ll pos[5];
ll re[5];

ll cnt;
ll a,b;
ll aa,bb;

void recursive(int n){
    if(n == 5){
        for(int i = 0;i < 5;i++){
            re[i] = num[pos[i]];
        }
        
        if( (re[0] + re[1]) & 1 != 0
            || (re[0] - re[1]) & 1 != 0
            || re[0] < re[1])
            return;
        
        a = (re[0] + re[1]) / 2;
        b = (re[0] - re[1]) / 2;

        if(b == 0) return;
        // cout << a << ' ' << b << '\n';

        if(a*b == re[2] && a/b == re[3] && a%b == re[4]){
            if(a > b && a > 0 && b > 0 && a != aa && b != bb && a <= 1000000 && b <= 1000000){
                aa = a;
                bb = b;
                cnt++;
            }
        }
        return;
    }

    for(int i = 0;i < 5;i++){
        if(check[i]) continue;

        check[i] = true;
        pos[n] = i;
        recursive(n + 1);
        check[i] = false;
    }

    return;
}

void solve(){
    cnt = 0;

    for(int i = 0;i < 5;i++){
        cin >> num[i];
    }

    recursive(0);


    // cout << cnt << '\n';
    if(cnt == 1){
        cout << aa << ' ' << bb << '\n';
    }
    else{
        cout << "0 0\n";
    }

    return;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    ll q;
 
    cin >> q;

    while(q--)
        solve(); 

    return 0;
}