Submission

Score: 0

User: Hxluk.ka

Problemset: anna

Language: cpp

Time: 0.017 second

Submitted On: 2026-03-12 11:50:15

#include <iostream>
#include <algorithm>
using namespace std;
int a, b, t, ca, cb, cnt;
int g[5];
void solve() {
	for (int i=0; i<5; i++) cin>>g[i];
	sort(g, g+5);
	int amb=g[4];
	int apb=g[3];
	ca=cb=cnt=0;
	for (int i=0; i<=apb/2; i++) {
		int ta=i;
		int tb=apb-i;
		int vs[3]={0};
		if (ta*tb!=amb) {
			continue;
		}
		int p=0;
		for (int i=0; i<3; i++) if ((int)(tb/ta)==g[i]) {vs[i]++, p=1; break;}
		if (!p) continue;
		for (int i=0; i<3; i++) if (!vs[i]&&(tb-ta)==g[i]) {vs[i]++, p=0; break;}
		if (p) continue;
		for (int i=0; i<3; i++) if (!vs[i]&&(tb%ta)==g[i]) {vs[i]++, p=1; break;}
		if (!p) continue;
		ca=tb, cb=ta, cnt++;
	}
	if (cnt!=1) cout<<"0 0\n";
	else cout<<ca<<' '<<cb<<'\n';
}
int main() {
	cin.tie(0)->sync_with_stdio(0), cout.tie(0);
	cin>>t;
	while (t--) solve();
}