题解 100% AC

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
    int k;
    cin>>k;
    while(k--) {
        ll n,d,e;
        cin>>n>>d>>e;
        ll m=n-e*d+2,a=-1,b=m,c=-n,p,q;
        ll delta=b*b-4*a*c;
        if(delta<0){
        	cout<<"NO"<<endl;
            continue;
        }else{
        	ll x=sqrt(delta);
            if(x*x!=delta){
            	cout<<"NO"<<endl;
                continue;
            }else{
            	p=(-b-x)/(2*a);
                q=m-p;
            }
            cout<<min(q,p)<<" "<<max(p,q)<<endl;
        }
    }
    return 0;
}