Submission

Score: 0

User: mantaggez

Problemset: anna

Language: cpp

Time: 1.086 second

Submitted On: 2026-03-20 20:46:50

#include <bits/stdc++.h>

using namespace std;
using pii = pair<int, int>;

int n;
int num[6];

void solve()
{
    for(int i=1;i<=5;i++) cin >> num[i];
    int mx = *max_element(num + 1, num + 6);
    sort(num + 1, num + 6);
    vector<pii> factor;
    for(int i=1;i<=mx;i++) {
        if(mx % i == 0 && i > mx / i)
            factor.push_back({i, mx / i});
    }

    if(mx - 1 > 1) factor.push_back({mx - 1, 1});
    int A = 0, B = 0, ans = 0;
    for(auto& [a, b] : factor) {
        vector<int> 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());
        int cnt = 0;
        for(int 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, ans++;
    }

    if(ans > 1) cout << 0 << ' ' << 0 << '\n';
    else cout << A << ' ' << B << '\n';
}

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

    return 0;
}