[BZOJ5244] [Fjwc2018] 最大真因数 [Min25筛]

传送门

考虑每一个 Min(x) 时的贡献，发现就是 Min25 筛时没有被考虑的数的和 / Min(x)

然后Min25 筛时顺便筛出答案即可

#include<bits/stdc++.h>
#define N 1000050
using namespace std;
typedef long long ll;
ll l, r, prim[N]; int tot; bool isp[N];
ll m, S, pos, s[N], f[N], id1[N], id2[N], w[N];
void prework(){
	for(int i = 2; i <= N-50; i++){
		if(!isp[i]) prim[++tot] = i, s[tot] = s[tot-1] + i;
		for(int j = 1; j <= tot; j++){
			if(i * prim[j] > N-50) break;
			isp[i * prim[j]] = 1; if(i % prim[j] == 0) break;
		}
	}
}
ll Id(ll n, ll x){ return x <= S ? id1[x] : id2[n/x];}
ll Yolanda(ll n){
	m = 0; S = sqrt(n); pos = lower_bound(prim+1, prim+tot+1, S) - prim; if(prim[pos] > S) pos--;
	for(ll l = 1, r; l <= n; l = r+1){
		ll v = n/l; r = n/v; if(v <= S) id1[v] = ++m; else id2[n/v] = ++m;
		w[m] = v; if(w[m]&1) f[m] = (w[m]+1)/2 * w[m] - 1; else f[m] = w[m]/2 * (w[m]+1) - 1;
	} 
	ll ans = 0;
	for(int i = 1; i <= pos; i++){
		for(int j = 1; j <= m && prim[i] * prim[i] <= w[j]; j++){
			ll k = Id(n, w[j] / prim[i]);
			ll v = f[k] - s[i-1];
			if(j == 1) ans += v, f[j] -= prim[i] * v;
		}
	} return ans;
}
int main(){
	scanf("%lld%lld", &l, &r); prework();
	cout << Yolanda(r) - Yolanda(l-1);
	return 0;
}