Submission

Score: 0

User: Seng

Problemset: anna

Language: cpp

Time: 0.002 second

Submitted On: 2026-06-11 20:37:10

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

void fid(int &p, int &k, int now){
	if(now == 0){
		p = 1;
		k = 2;
	}
	else if(now == 1){
		p = 0;
		k = 2;
	}
	else{
		p = 0;
		k = 1;
	}
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int n;cin >> n;
	while(n--){
		vector<ll> num(5);
		ll ad, mn, t, mod, div;
		ll a, b;
		for(int i = 0; i < 5; i++){
			cin >> num[i];
		} 
		sort(num.begin(), num.end());
		t = num[4];
		ad = num[3];
		bool is_ans = false;
		for(int i = 2; i >= 0; i--){
			mn = num[i];
			a = (ad+mn)/2;
			b = ad-a;	
			if(a*b != t) continue;
			int id1, id2;
			fid(id1, id2, i);
			if((a/b == num[id1] && a%b == num[id2]) || (a/b == num[id2] && a%b == num[id1])){
				cout << a << " " << b << '\n';
				is_ans = true;
				break;
			}
		}
		if(is_ans == false) cout << "0 0" << '\n';
	}
}
// 7 5
// 35  12 2   1   2 
// t  add mn div mod
//