Submission

Status:

[PPP-SSSSSSSSSS]

Subtask/Task Score:

{0/100}

Score: 0

User: devilpoohs

Problemset: anna

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-05 13:14:57

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

void solve(){
    int ar[5];
    unordered_map<int,int> mp;
    for(int i=0;i<5;i++){
        cin>>ar[i];
    }
    sort(ar,ar+5);
    int a,b;
    a=ar[4];
    b=ar[3];
    mp[ar[4]]++;
    mp[ar[3]]++;
    mp[ar[2]]++;
    mp[ar[1]]++;
    mp[ar[0]]++;
    bool vis[4];
    set<pair<int,int>> ans;
    for(int i=1;i<=sqrt(a);i++){
        if(a%i==0){
            int c=i,d=a/i;
            // cout<<c<<' '<<d<<'|'<<d-c<<' '<<d/c<<' '<<d%c<<' '<<d+c;
            int cnt=0;
            memset(vis,false,sizeof(vis));
            for(int i=0;i<4;i++){
                if(d-c==ar[i] and vis[0]==false){
                    vis[0]=true;
                    cnt++;
                }else if(d/c==ar[i] and vis[1]==false){
                    vis[1]=true;
                    cnt++;
                }else if(d%c==ar[i] and vis[2]==false){
                    vis[2]=true;
                    cnt++;
                }else if(d+c==ar[i] and vis[3]==false){
                    vis[3]=true;
                    cnt++;
                }
            }
            if(cnt==4){
                 ans.emplace(d,c);
            }
            // cout<<'\n';
        }
    }
    for(int i=1;i<=sqrt(b);i++){
        if(b%i==0){
            int c=i,d=b/i;
            // cout<<c<<' '<<d<<'|'<<d-c<<' '<<d/c<<' '<<d%c<<' '<<d+c;
            int cnt=0;
            memset(vis,false,sizeof(vis));
            for(int i=0;i<5;i++){
                if(i==3) continue;
                if(d-c==ar[i] and vis[0]==false){
                    vis[0]=true;
                    cnt++;
                }else if(d/c==ar[i] and vis[1]==false){
                    vis[1]=true;
                    cnt++;
                }else if(d%c==ar[i] and vis[2]==false){
                    vis[2]=true;
                    cnt++;
                }else if(d+c==ar[i] and vis[3]==false){
                    vis[3]=true;
                    cnt++;
                }
            }
            if(cnt==4){
                ans.emplace(d,c);
            }
        }
    }
    if(ans.size()>1 or ans.empty()){
        cout<<"0 0\n";
    }else{
        cout<<ans.begin()->first<<' '<<ans.begin()->second<<'\n';
    }
}

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