CF1485C(整除分块+根号分块)

思路:

推柿子:

那么,最终的答案其实就是.

我们可以先暴力枚举, 对于b >= √x的部分,min(x, b * b + b - 1)一定为x,此时求.

对于,我们套路的处理方法就是,求出块长,先令,然后.

引理:

证明:

.

由引理可知,,然后再换元回来即可.

这道题中,令,, .

代码:

#include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false), cin.tie(0) 
#define ll long long 
#define double long double
#define ull unsigned long long 
#define PII pair<int, int> 
#define PDI pair<double, int> 
#define PDD pair<double, double> 
#define debug(a) cout << #a << " = " << a << endl 
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end() 
#define mem(x, y) memset((x), (y), sizeof(x)) 
#define lbt(x) (x & (-x)) 
#define SZ(x) ((x).size()) 
#define inf 0x3f3f3f3f 
#define INF 0x3f3f3f3f3f3f3f3f
namespace nqio{const unsigned R = 4e5, W = 4e5; char *a, *b, i[R], o[W], *c = o, *d = o + W, h[40], *p = h, y; bool s; struct q{void r(char &x){x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++;} void f(){fwrite(o, 1, c - o, stdout); c = o;} ~q(){f();}void w(char x){*c = x;if (++c == d) f();} q &operator >>(char &x){do r(x);while (x <= 32); return *this;} q &operator >>(char *x){do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this;} template<typename t> q&operator>>(t &x){for (r(y),s = 0; !isdigit(y); r(y)) s |= y == 45;if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this;} q &operator <<(char x){w(x);return *this;}q &operator<< (char *x){while (*x) w(*x++); return *this;}q &operator <<(const char *x){while (*x) w(*x++); return *this;}template<typename t> q &operator<< (t x) {if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p);return *this;}}qio; }using nqio::qio;
using namespace std;
int x, y;
void solve() {
	qio >> x >> y;
	int ans = 0;
	for (int b = 1, mx = min((int)ceil(sqrt(x)), y); b <= mx; ++b) ans += min(x, b * b + b - 1) / (b + 1);
	if (y - (int)ceil(sqrt(x)) <= 0) return qio << ans << "\n", void(0);
	for (int l = (int)ceil(sqrt(x)) + 1, r; l <= y; l = r + 1) {
		if (x / (l + 1)) r = min(x / (x / (l + 1)) - 1, y);
		else r = y;
		ans += (r - l + 1) * (x / (l + 1));
	}
	qio << ans << "\n";
}
signed main() {
	int T = 1;
	qio >> T;
	while (T--) solve();
}