我真是个废物,现在PJ-2都过不了了……
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
int k;
scanf("%d", &k);
while (k--)
{
long long n, d, e;
scanf("%lld%lld%lld", &n, &d, &e);
long long m = n - d * e + 2;
long long t = m * m - 4 * n;
if (t < 0) printf("NO\n");
else if (sqrt(t) != floor(sqrt(t))) printf("NO\n");
else
{
long long p = (m - sqrt(t)) / 2;
long long q = (m + sqrt(t)) / 2;
if (p <= 0 || q <= 0) printf("NO\n");
else printf("%lld %lld\n", p, q);
}
}
return 0;
}