解方程题解

#include<bits/stdc++.h>
using namespace std;
int main(){
    long long k, n, d, e, m;
    cin>>k;
    while (k--){
        cin >> n >> d >> e;
        m=n-e*d+2;
        double p=(m-1.0*sqrt(m*m-4*n))/2.0;
        long long llp=p;
        long long q=m-p;
        if (m*m-4*n<0 || llp!=p || llp*q!=n)
            cout << "NO" << endl;
        else 
            cout << llp << " " << q << endl;
    }
    return 0;
}