传送门

[100pts记录](https://www.luogu.com.cn/record/174422241)
           [60pts记录](https://www.luogu.com.cn/record/174422154)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
	ll k,n,e,d;
	scanf("%lld",&k);
	while(k--)
	{
		scanf("%lld%lld%lld",&n,&e,&d);
		ll sub=sqrt((n-e*d+2,2)*(n-e*d+2,2)-4*n);//如果在这里把(n-e*d+2,2)*(n-e*d+2,2)改成pow((n-e*d+2,2),2)就是60pts
		ll add=n-e*d+2;
		ll p=(sub+add)/2,q=(add-sub)/2;
		if(p*q==n && e*d==(p-1)*(q-1)+1 && p && q)
		{
			printf("%lld %lld\n",min(p,q),max(p,q));
			continue;
		}
		printf("NO\n");
	}
}