数论分块

首先一道例题

题意

给定$n,k<=1e9$，求$$\sum _{i=1}^{n}k\%i$$

直接算肯定是要T的，我们想办法对$k\%i$进行变形

$$k\%i=k-i\ast \lfloor \frac{k}{i}\rfloor$$

$$\sum _{i=1}^{n}k\%i=\sum _{i=1}^{n}k-i\ast \lfloor \frac{k}{i}\rfloor =nk-\sum _{i=1}^{n}i\ast \lfloor \frac{k}{i}\rfloor$$

那么对这个有限的$\lfloor \frac{k}{i}\rfloor$分块即可。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAXN 150005
#define LL long long
#define Mod 1000000007
#define Int register long long
using namespace std;
inline void read(LL &x)
{
	x = 0;
	LL f = 1;
	char s = getchar();
	while (s < '0' || s > '9')
	{
		if (s == '-')
			f = -1;
		s = getchar();
	}
	while (s >= '0' && s <= '9')
	{
		x = (x << 3) + (x << 1) + (s ^ 48);
		s = getchar();
	}
	x *= f;
}
inline LL Min(LL x,LL y)
{
	return x < y ? x : y;
}
int main()
{
	LL n, k;
	read( n ); read( k );
	LL Ans = n * k;
	for (Int l = 1, r; l <= n; l = r + 1)
	{
		LL t = k / l;
		if (! t)
			r = n;
		else r = Min(n, k / t);
		Ans -= (l + r) * (r - l + 1) / 2 * t;
	}
	printf("%lld", Ans);
	return 0;
}