【数学】Non-coprime Split—CF1872C

Non-coprime Split—CF1872C

• 很有意思的一道题，40多分钟我才做出来

$Code$

#include <bits/stdc++.h>
#define int long long
#define sz(a) ((int)a.size())
using namespace std;
using PII = pair<int, int>;
using i128 = __int128;
const int N = 2e5 + 10;

int l, r;

void solve() {
	cin >> l >> r;
	cout << "        ";
	for (int i = l; i <= r; i ++) {
		for (int j = 2; j * j <= i; j ++) { // 遍历gcd(a, b)
			if (i % j == 0) {
				if (i / j >= 2 || i / (i / j) >= 2) {
					cout << j << ' ' << i - j << "\n";
					return;
				}
			}
		}
	}
	cout << "-1\n";
}

signed main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int T = 1;
	cin >> T; cin.get();
	while (T --) solve();
	return 0;
}