bzoj 4916 神犇和蒟蒻

最新推荐文章于 2019-02-27 13:12:00 发布

我要吃熊猫

最新推荐文章于 2019-02-27 13:12:00 发布

阅读量542

点赞数 1

分类专栏：杜教筛

本文链接：https://blog.csdn.net/chai_jing/article/details/72828417

版权

杜教筛专栏收录该内容

6 篇文章 0 订阅

订阅专栏

//bzoj 4916 神犇与蒟蒻 
#include<map>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 10000000
#define ll long long
#define M(a) memset(a,0,sizeof a)
#define fo(i,j,k) for(i=j;i<=k;i++)
const int mxn=10000005;
const int mod=1e9+7;
using namespace std;
map <int,int> mp;
bool vis[mxn];
ll phi[mxn];
ll inv2,inv6;
int m,T,pri[mxn];
inline ll ksm(ll x,int k)
{
	if(k==1) return x;
	ll tmp=ksm(x,k>>1);
	if(k&1) return tmp*tmp%mod*x%mod;
	return tmp*tmp%mod;
}
inline void init()
{
	int i,j;
	puts("1");
	phi[1]=1;
	inv2=500000004;
	inv6=166666668;
	fo(i,2,N)
	{
		if(!vis[i]) pri[++pri[0]]=i,phi[i]=i-1;
		for(j=1;j<=pri[0] && (ll)i*pri[j]<=N;j++)
		{
			vis[i*pri[j]]=1;
			if(i%pri[j]==0)
			{
				phi[i*pri[j]]=phi[i]*pri[j]%mod;
				break;
			}
			phi[i*pri[j]]=phi[i]*(pri[j]-1)%mod;
		}
	}
	fo(i,1,N) phi[i]=phi[i]*i%mod;
	fo(i,1,N) phi[i]=(phi[i]+phi[i-1])%mod;
}
inline ll S(ll x) 
{
	return (x*(x+1)%mod*inv2)%mod;
} 
inline ll solve(ll n)
{
	int i,j;
	if(n<=N) return phi[n];
	if(mp.count(n)) return mp[n];
	ll now=n*(n+1)%mod*(n+n+1)%mod*inv6%mod,sum=0;
	for(int i=2,last=0;i<=n;i=last+1)
	{
		last=n/(n/i);
		sum=(sum+((S(last)-S(i-1)+mod))%mod*solve(n/i)%mod)%mod;
	}
	mp[n]=(now-sum+mod)%mod;
	return (now-sum+mod)%mod;
}
int main()
{
	int i,j;
	ll x;
	init();
	scanf("%lld",&x);
	printf("%lld\n",solve(x));
	return 0;
}