report

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define WA AC
int main(){
    ll k;
    cin>>k;
    ll n[k]={0},d[k]={0},e[k]={0};
    for(int i=0;i<k;i++){
		cin>>n[i]>>d[i]>>e[i];
	}
	for(int i=0;i<k;i++){
		ll p=-1,q=-1;
		for(int j=1;j<=sqrt(n[i]);j++){
			if(n[i]%j==0){
				p=j;
				q=n[i]/j;
				if(not (e[i]*d[i] == (p-1)*(q-1)+1)){
					p=-1;
					q=-1;
				}
			}
		}
		if(p==-1&&q==-1) cout<<"NO";
		else cout<<p<<" "<<q;
		cout<<endl;
	}
    return 0;
}

只想到了分解因数(本人六年级蒟蒻),大佬帮个忙!!!