40 救命
查看原帖
40 救命
921176
leiwenjin1234楼主2023/10/9 23:09
#include<bits/stdc++.h>
using namespace std;
int main() {
	int k;
	cin >> k;
	while (k--) {
		long long e, d, n;
		cin >> n >> e >> d;
		long long m = n - e * d + 2;
		long long p = (m - sqrt(m * m - 4 * n)) / 2;
		long long q = (m+ sqrt(m * m - 4 * n)) / 2;
		if (p * q == n && (p - 1) * (q - 1) + 1 == e * d&&p&&q) {
			cout << min(p, q) << " " << max(p, q) << endl;

		} else {
			cout << "No"<<endl;
		}
	}
}
2023/10/9 23:09
加载中...