Submission

Score: 100

User: Phat12

Problemset: anna

Language: cpp

Time: 0.002 second

Submitted On: 2025-11-04 19:44:54

/*
TASK: c2_knb64_anna.cpp
LANG: C++
AUTHOR: Phat
*/
#include <bits/stdc++.h>
#define FO(i,L,R) for (int i = L; i < R; i++)
#define int long long
using namespace std;
int arr[5];
int32_t main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int Q;
    cin >> Q;
    while (Q--) {
        for (int i=0;i<5;i++) cin >> arr[i];
        sort(arr,arr+5);
        int ansx,ansy;
        int cnt=0;
        do{
            if (arr[0]+arr[1] % 2 == 1) continue;
            int x = (arr[0]+arr[1])/2;
            int y = (x-arr[1]);
            if (y==0 || x==0 || x==y) continue;
            if (x+y!=arr[0]) continue;
            if (x-y!=arr[1]) continue;
            if (x*y!=arr[2]) continue;
            if (x%y!=arr[3]) continue;
            if (x/y!=arr[4]) continue;
            cnt++;
            ansx=x;
            ansy=y;
        } while (next_permutation(arr,arr+5));
        if (cnt==1) cout << ansx << ' ' << ansy << '\n';
        else cout << "0 0\n";
    }
    return 0;
}