Sanrd

题目
https://uoj.ac/problem/188
求
$$\sum _{i=l}^{r}f(i)$$
$f(i)$是$i$的次大质因子(重复的也考虑)，比如$18$的次大质因子是$3$，如果是素数或$1$，则为$0$。$l+r\le 10^{11}$

思路
考虑$Min25$筛时的$S$函数的$dp$，素数部分贡献是$0$，则只有合数的贡献
$$\begin{array}{rl}S(n,j)& =\sum _{i=j+1}^{\pi (\sqrt{n})}\sum _{e=1}^{p_i^e\le n}(f(p_i^e)[e>1]+\sum _{k=2}^{\lfloor \frac{n}{p_i^e}\rfloor }f(p_i^{e}k)[minp(k)>p_i])\end{array}$$
把后面的$k$分成合数和素数，如果$k$是素数，则$f(p_i^{e}k)=p_i$，否则$f(p_i^{e}k)=f(k)$，于是有
$$\begin{array}{rl}& \sum _{k=2}^{\lfloor \frac{n}{p_i^e}\rfloor }f(p_i^{e}k)[minp(k)>p_i]\\ =& p_i\sum _{q=i+1}^{p_q\le \lfloor \frac{n}{p_i^e}\rfloor }1+\sum _{k=2}^{\lfloor \frac{n}{p_i^e}\rfloor }f(k)[minp(k)>p_i且k\notin \mathbb{P}]\\ =& p_i\sum _{q=i+1}^{p_q\le \lfloor \frac{n}{p_i^e}\rfloor }1+S(\lfloor \frac{n}{p_i^e}\rfloor ,i)\end{array}$$
后面式子成立是因为$S$函数素数贡献为$0$，只要考虑合数。综上
$$S(n,j)=\sum _{i=j+1}^{\pi (\sqrt{n})}\sum _{e=1}^{p_i^e\le n}(f(p_i^e)[e>1]+p_i\sum _{q=i+1}^{p_q\le \lfloor \frac{n}{p_i^e}\rfloor }1+S(\lfloor \frac{n}{p_i^e}\rfloor ,i))$$
${\sum }_{q=i+1}^{p_q\le \lfloor \frac{n}{p_i^e}\rfloor }1$这个再用$g$函数算就行，注意先讨论上下界的大小关系，因为上下界并不严格。

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=3000009;
int isp[N],tot,cnt,sqr;
ll psum[N],psum1[N];
ll g[N],g1[N];
ll l,r,prime[N];
ll w[N];
ll id[N],id1[N];
ll ans,ans1;
ll calsum(ll x){
    return x-1;
}
ll calsum1(ll x){
    return 0;
}
ll cal(ll x){
    return 1;
}
ll cal1(ll x){
    return 0;
}
ll S(ll x,int y,ll n){
    if(prime[y]>=x)return 0;
    ll res=0;
    for(int i=y+1;i<=tot&&prime[i]*prime[i]<=x;i++){
        ll tmp=prime[i];
        for(int e=1;tmp<=x;e++,tmp*=prime[i]){
            int locate=x/tmp<=sqr?id[x/tmp]:id1[n/(x/tmp)];
            res=(res+prime[i]*((e>1)+((g[locate]-psum[i])<0?0:(g[locate]-psum[i])))+S(x/tmp,i,n));
        }
    }
    return res;
}
void solve(ll n,ll &ans){
    sqr=sqrt(n);
    isp[1]=1;
    tot=cnt=0;
    psum[0]=psum1[0]=g[0]=g1[0]=0;
    for(int i=2;i<=sqr;i++){
        if(!isp[i])
            prime[++tot]=i;
        for(int j=1;j<=tot&&i*prime[j]<=sqr;j++){
            isp[i*prime[j]]=1;
            if(i%prime[j]==0)
                break;
        }
    }

    for(int i=1;i<=tot;i++)
        psum[i]=(psum[i-1]+cal(prime[i])),psum1[i]=(psum1[i-1]+cal1(prime[i]));
    for(ll l=1,r;l<=n;l=r+1){
        r=n/(n/l);
        ll tmp=n/l;
        w[++cnt]=tmp;
        g[cnt]=calsum(tmp);
        g1[cnt]=calsum1(tmp);
        if(tmp<=sqr)
            id[tmp]=cnt;
        else
            id1[n/tmp]=cnt;
    }

    for(int i=1;i<=tot;i++){
        for(int j=1;j<=cnt&&prime[i]*prime[i]<=w[j];j++){
            ll tmp=w[j]/prime[i];
            int locate=tmp<=sqr?id[tmp]:id1[n/tmp];
            g[j]=(g[j]-cal(prime[i])*(g[locate]-psum[i-1]));
            g1[j]=(g1[j]-cal1(prime[i])*(g1[locate]-psum1[i-1]));
        }
    }
    ans=S(n,0,n);
}
int main(){
    cin>>l>>r;
    solve(l-1,ans);
    solve(r,ans1);
    cout<<ans1-ans;
    return 0;
}