min25筛+洛谷P5325

xyxyyds，xxy数学不好

//这个代码是求f(x)=x的min25筛，也就是数本身的

//#pragma GCC optimize(3,"Ofast","inline")
//#include<unordered_map>
//#include<unordered_set>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<functional>
#include<cstring>
#include<string>
#include<cstdlib>
#include<queue>
#include<map>
#include<algorithm>
#include<set>
#include<stack>
#include<vector>
#include<sstream>
#include<list>
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f;
int mod=1000000007;
const int N=2e3+10;
const int maxn=2e5+10;

ll prime[maxn],isprime[maxn],sum[maxn],w[maxn],g[maxn];
ll id1[maxn],id2[maxn];
int num;
ll sqr;

void getprime(int n)
{
    memset(prime,0,sizeof(prime));
    memset(isprime,1,sizeof(isprime));
    for(int i=2; i<=n; i++)
    {
        if(isprime[i])
            prime[++num]=i;
        for(int j=1; j<=num&&i*prime[j]<=n; j++)
        {
            isprime[i*prime[j]]=0;
            if(i%prime[j]==0)break;
        }
    }
}

int m;
ll n,inv2;

ll qpow(ll a,ll b,ll p)
{
    ll ans=1%p;
    while(b!=0)
    {
        if(b&1)
        {
            ans=(ans%p*a%p)%p;
        }
        a=(a*a)%p;
        b>>=1;
    }
    return ans;
}

ll min_25(ll x)
{
    ll l,r;
    ll sqr=sqrt(x);
    for(l=1; l<=x; l=r+1)
    {
        r=x/(x/l);
        w[++m]=x/l;
        if(w[m]<=sqr)id1[w[m]]=m;
        else id2[x/w[m]]=m;
        g[m]=((((1+w[m])%mod)*(w[m]%mod))%mod*inv2-1+mod)%mod;//
    }
    //离散化杀我，将n/x下取整的所有可能的数离散化（因为用不到1-n所有的）
    for(int j=1; j<=num; j++)
        for(int i=1; i<=m&&prime[j]*prime[j]<=w[i]; i++)
        {
            int k=(w[i]/prime[j]<=sqr)?id1[w[i]/prime[j]]:id2[x/(w[i]/prime[j])];
            g[i]=(g[i]-prime[j]*(g[k]-sum[j-1]))%mod;g[i]=(g[i]+mod)%mod;//
        }
    return g[1];
}

ll s(ll x,ll y)
{
    if(x<=1&&prime[y]>x)return 0;
    int k=(x<=sqr)?id1[x]:id2[n/x];
    ll ans=g[k]-sum[y-1];
    for(int i=y;i<=num&&prime[i]*prime[i]<=x;i++)
    {
        ll t1=prime[i],t2=t1*t1;
        for(int e=1;t2<=x;e++,t1=t2,t2*=prime[i])
            ans+=((s(x/t1,i+1)*(t1)%mod)%mod+(t2%mod))%mod,ans%=mod;
    }
    return ans;
}

int main()
{
    inv2=qpow(2,mod-2,mod);
    cin>>n;
    sqr=sqrt(n);
    getprime(sqr);
    for(int i=1; i<=num; i++)sum[i]=(sum[i-1]+prime[i])%mod;
    cout<<min_25(n)<<endl;//1-n的所有素数的f和
    cout<<(s(n,1)+1)%mod<<endl;//1-n的f和
    cout<<((((1+n)%mod)*(n%mod))%mod*inv2)%mod<<endl;//检验
    return 0;
}

洛谷P5325 代码

//#pragma GCC optimize(3,"Ofast","inline")
//#include<unordered_map>
//#include<unordered_set>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<functional>
#include<cstring>
#include<string>
#include<cstdlib>
#include<queue>
#include<map>
#include<algorithm>
#include<set>
#include<stack>
#include<vector>
#include<sstream>
#include<list>
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f;
ll mod=1000000007;
const int N=2e3+10;
const int maxn=2e5+10;

ll prime[maxn],isprime[maxn],sum[maxn],sum1[maxn],w[maxn],g[maxn],g1[maxn];
ll id1[maxn],id2[maxn];
ll num;
ll sqr;

void getprime(ll n)
{
    memset(prime,0,sizeof(prime));
    memset(isprime,1,sizeof(isprime));
    for(ll i=2; i<=n; i++)
    {
        if(isprime[i])
            prime[++num]=i;
        for(ll j=1; j<=num&&i*prime[j]<=n; j++)
        {
            isprime[i*prime[j]]=0;
            if(i%prime[j]==0)break;
        }
    }
}

ll m;
ll n;
ll inv;
ll inv2;

ll qpow(ll a,ll b,ll p)
{
    ll ans=1%p;
    while(b!=0)
    {
        if(b&1)
        {
            ans=(ans%p*a%p)%p;
        }
        a=(a*a)%p;
        b>>=1;
    }
    return ans;
}

void min_25(ll x)
{
    ll l,r;
    for(l=1; l<=x; l=r+1)
    {
        r=x/(x/l);
        w[++m]=x/l;
        if(w[m]<=sqr)id1[w[m]]=m;
        else id2[x/w[m]]=m;
        g[m]=(((((w[m]%mod)*((1+w[m])%mod))%mod)*((((2*w[m]+1)%mod)*inv)%mod))%mod-1+mod)%mod;//
        g1[m]=(((((1+w[m])%mod)*(w[m]%mod))%mod*inv2)%mod-1+mod)%mod;//
    }
    for(int j=1; j<=num; j++)
        for(int i=1; i<=m&&prime[j]*prime[j]<=w[i]; i++)
        {
            ll k=(w[i]/prime[j]<=sqr)?id1[w[i]/prime[j]]:id2[x/(w[i]/prime[j])];
            g[i]=(g[i]-((prime[j]*prime[j])%mod)*((g[k]-sum[j-1])%mod))%mod;g[i]=(g[i]+mod)%mod;//
            g1[i]=(g1[i]-prime[j]*(g1[k]-sum1[j-1]))%mod;g1[i]=(g1[i]+mod)%mod;//
        }
}

ll s(ll x,ll y)
{
    if(x<=1&&prime[y]>x)return 0;
    ll k=(x<=sqr)?id1[x]:id2[n/x];
    ll ans=((g[k]-sum[y-1]-(g1[k]-sum1[y-1])+mod+mod)%mod);
    for(int i=y;i<=num&&prime[i]*prime[i]<=x;i++)
    {
        ll t1=prime[i],t2=t1*t1;
        for(int e=1;t2<=x;e++,t1=t2,t2*=prime[i])
        {
            ans=(ans+((s(x/t1,i+1)*(((t1%mod)*((t1-1+mod)%mod))%mod))+((t2%mod)*((t2-1+mod)%mod))))%mod;
            if(ans<0)ans+=mod;
        }
    }
    return ans;
}

int main()
{
    inv=qpow(6,mod-2,mod);
    inv2=qpow(2,mod-2,mod);
    scanf("%lld",&n);
    sqr=sqrt(n);
    getprime(sqr);
    for(int i=1; i<=num; i++)sum[i]=(sum[i-1]+prime[i]*prime[i])%mod;
    for(int i=1; i<=num; i++)sum1[i]=(sum1[i-1]+prime[i])%mod;
    min_25(n);
    printf("%lld\n",(s(n,1)+1)%mod);
    return 0;
}