Submission

Status:

[PPPPPPPPPPPPPP]

Subtask/Task Score:

{100/100}

Score: 100

User: ssss

Problemset: anna

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-09 20:36:29

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

int main(){
    long long n;
    cin>>n;
    while(n--){
        vector<long long>num(5);
        for(int i=0;i<5;i++){
            cin>>num[i];
        }
        sort(num.begin(),num.end());
        vector<long long>tar = num;
        set<pair<long long,long long>>ans;
        do{
            long long s = num[0];
            long long d = num[1];
            if((s+d)%2){
                continue;
            }
            long long a = (s+d)/2;
            long long b = (s-d)/2;
            if(a<=b||b<=0){
                continue;
            }
            vector<long long>check;
            check.push_back(a+b);
            check.push_back(a-b);
            check.push_back(a*b);
            check.push_back(a%b);
            check.push_back(a/b);
            sort(check.begin(),check.end());
            if(check==tar){
                ans.insert({a,b});
            }
        }while(next_permutation(num.begin(),num.end()));
        if(ans.size()==1){
            auto p=*ans.begin();
            cout<<p.first<<" "<<p.second<<"\n";
        }else{
            cout<<"0 0"<<"\n";
        }
    }
    return 0;
}