#include "bits/stdc++.h" #define rep(i,n) for(int i=0;i> X; int l = max(1, X / 2 - 1000), r = min(X - 1, X / 2 + 1000); vector d(r - l + 1, 0); for (int i = 1; i < 2000; i++) { for (int j = (l + i - 1) / i * i; j <= r; j += i) { d[j - l]++; if (j / i >= 2000) d[j - l]++; //cout << "i=" << i << " d[" << j << "]=" << d[j - l] << endl; } } vector f(r - l + 1, 0); for (int i = l; i <= r; i++) { f[i - l] = i - d[i - l]; } int mind = 1e9; for (int A = l; A <= r; A++) { int B = X - A; if (B < l || B > r) continue; mind = min(mind, abs(f[A - l] - f[B - l])); } for (int A = l; A <= r; A++) { int B = X - A; if (B < l || B > r) continue; if (mind == abs(f[A - l] - f[B - l])) cout << A << " " << B << endl; } //rep(i, r - l + 1) cout << "f(" << i + l << ")=" << f[i] << endl; //rep(i, r - l + 1) cout << "d(" << i + l << ")=" << d[i] << endl; }