作者:
Coinisi.
,
2023-01-20 09:17:41
,
所有人可见
,
阅读 10
//这里填你的代码^^
#include <iostream>
#include <cstring>
#include <algorithm>
typedef long long LL;
using namespace std;
int main()
{
int k; cin >> k;
while( k -- )
{
LL n, e, d; cin >> n >> e >> d;// n 为 p * q;
LL ed = e * d, s = n + 2 - ed;// s 为 p + q;
// LL m = n - ed + 2; m 为 s;
LL l = 1, r = s >> 1;
while(l < r)
{
LL mid = (l + r) >> 1;
if(mid * (s - mid) >= n) r = mid;
else l = mid + 1;
}
if(l * (s - l) == n) cout << l << ' ' << s - l << endl;
else puts("NO");
}
return 0;
}
//注意代码要放在两组三个点之间,才可以正确显示代码高亮哦~