0分求解（希望60分）

#include<iostream>
using namespace std;
const int maxn = 10000000;
long long n, a[maxn], b[maxn], c[maxn], p, q;
int main() {
    ios::sync_with_stdio(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i] >> c[i];
    }
    bool flag = 1;
    for (int j = 1; j <= n; j++) {
        flag = 1;
        for (int i = 1; i * i <= a[j]; i++) {
            if (a[j] % i != 0) {
                continue;
            }
            p = i, q = a[i] / p;
            if (a[j] == q * p && b[j] * c[j] == (p - 1) * (q - 1) + 1) {
                flag = 0;
                cout << p << " " << q<<endl;
                break;
            }
        }
        if (flag) {
            cout << "NO" << endl;
        }
    }
    return 0;
}