BZOJ 4176: Lucas的数论 莫比乌斯反演 + 杜教筛

我这种智障都能随手切，一定是傻题

#include<bits/stdc++.h>
#define setIO(s) freopen(s".in","r",stdin) 
#define maxn 10000004 
#define M 5000001 
#define ll long long
using namespace std;
const long long mod = 1000000007; 
int cnt; 
ll sumv[maxn]; 
bool vis[maxn]; 
int prime[maxn], mu[maxn]; 
inline void Linear_shaker()
{
	mu[1]=1; 
	int i,j; 
	for(i=2;i<=M;++i)
	{
		if(!vis[i]) prime[++cnt]=i, mu[i]=-1; 
		for(j=1;j<=cnt&&1ll*i*prime[j]<=M;++j) 
		{
			vis[i*prime[j]]=1; 
			if(i%prime[j]==0) 
			{
				mu[i*prime[j]]=0; 
				break; 
			}
			mu[i*prime[j]]=-mu[i]; 
		}
	}
	for(i=1;i<=M;++i) sumv[i]=(sumv[i-1]+1ll*mu[i]+mod)%mod;   
}
inline ll Sum(ll n)
{
	ll i,j,re=0; 
	for(i=1;i<=n;i=j+1)
	{
		j=n/(n/i); 
		re+=(j-i+1)%mod*(n/i)%mod; 
		re%=mod; 
	}
	return re;   
}
map<int,ll>ansmu; 
ll Get(ll n)
{
	if(n<=M) return sumv[n]; 
	if(ansmu[n]) return ansmu[n];  
	ll i,j,re=0; 
	for(i=2;i<=n;i=j+1)
	{
		j=n/(n/i); 
		re=(re+(j-i+1ll*1)%mod*(Get(n/i))%mod)%mod;  
	}
	return ansmu[n]=(1ll-re+mod)%mod; 
}
int main()
{
	// setIO("input"); 
	Linear_shaker(); 
	ll i,j,re=0; 
	int n; 
	scanf("%d",&n);    
	for(i=1;i<=n;i=j+1)
	{
		j=n/(n/i); 
		re=(re+((Get(j)-Get(i-1)+mod)%mod*Sum(n/i)%mod*Sum(n/i)%mod)%mod)%mod; 
	}
	printf("%lld\n",re); 
	return 0; 
}