Y • 3天前
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 beta = e*d -n -2;
ll delta = beta * beta - (4 * n);
ll x1 = (-beta + sqrt(delta)) / 2;
ll x2 = (-beta - sqrt(delta)) / 2;
if(x1 > x2) swap(x1,x2);
if(x1 + x2 == -beta && x1 * x2 == n) printf("%lld %lld\n",x1,x2);
else printf("NO\n");
}
return 0;
}
评论:
请先登录,才能进行评论