Submission

Score: 0

User: tnka4_

Problemset: anna

Language: cpp

Time: 0.256 second

Submitted On: 2026-03-09 14:25:57

#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <math.h>
using namespace std;

#define ll long long int

int main() {
    int n;
    cin >> n;
    vector<vector<ll>> seq(n, vector<ll>(5));
    for (int i=0; i<n; i++) {
        for (int j=0; j<5; j++) {
            cin >> seq[i][j];
        }
    }
    for (int i=0; i<n; i++) {
        sort(seq[i].rbegin(), seq[i].rend());
        ll mult = seq[i][0];
        int flag = 0;
        ll a, b;
        for (int j=1; j<=sqrt(mult); j++) {
            if (mult % j == 0 && j <= mult/j) {
                a = mult/j; b = j;
                vector<ll> p = {a*b, a+b, a-b, a%b, a/b};
                sort(p.rbegin(), p.rend());
                if (p == seq[i]) {
                    flag = 1;
                    break;
                }
            }
        }
        if (flag == 0) {
            a = 0; b = 0;
        }
        cout << a << " " << b << endl;
    }
}