Submission

Score: 0

User: mantaggez

Problemset: anna

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-20 21:21:07

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<ll, ll>;

ll t, n = 5;
ll num[6];

void solve()
{
    for(ll i=1;i<=n;i++) cin >> num[i];
    sort(num + 1, num + 6);
    vector<pii> valid;
    for(ll i=1;i<=n;i++) {
        for(ll j=1;j<=n;j++) {
            ll S = num[i] + num[j];
            ll D = num[i] - num[j];
            if(S % 2 == 0 && D % 2 == 0 && S / 2 > 0 && D / 2 > 0) {
                // cout << "Valid : " ;
                // cout << S << ' ' << D << '\n';
                valid.push_back({max(S / 2, D / 2), min(S / 2, D / 2)});
            }
        }
    }

    ll A = 0, B = 0;
    map<pii, ll> mp;
    for(auto& [a, b] : valid) {
        vector<ll> comp;
        // cout << "a : " << a << " b : " << b << '\n';
        comp.push_back(a / b);
        comp.push_back(a + b);
        comp.push_back(a - b);
        comp.push_back(a % b);
        comp.push_back(a * b);
        sort(comp.begin(), comp.end());
        ll cnt = 0;
        for(ll i=1;i<=5;i++) {
            if(num[i] == comp[i - 1]) {
                cnt++;
            }
        }
        // cout << "comp : "; 
        // for(auto& it : comp) cout << it << ' '; cout << '\n'; 
        if(cnt == 5) {
            A = a;
            B = b;
            mp[{A, B}] = 1;
        }
    }

    ll ans = mp.size();
    if(ans > 1) cout << 0 << ' ' << 0 << '\n';
    else cout << A << ' ' << B << '\n';
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin >> t;
    while(t--) {
        solve();
    }

    return 0;
}