Description
很久很久以前,有一只神犇叫yzy;
很久很久之后,有一只蒟蒻叫lty;
Input
请你读入一个整数N;1<=N<=1E9,A、B模1E9+7;
Output
请你输出一个整数A=\sum_{i=1}^N{\mu (i^2)};
请你输出一个整数B=\sum_{i=1}^N{\varphi (i^2)};
Sample Input
1
Sample Output
1
1
1
HINT
Source
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~杜教筛~
推导详见:http://blog.csdn.net/qq_32451161/article/details/72824819~
其中ni2和ni6分别是2和6的逆元,是用快速幂求出来的~
#include<cstdio>
#include<map>
using namespace std;
#define ll long long
#define modd 1000000007
#define M 10000000
#define ni2 500000004
#define ni6 166666668
int n,q[M/5];
ll phi[M];
bool b[M];
map<int,int> f;
ll read()
{
ll x=0,f=1;char ch=getchar();
while(ch<'0' || ch>'9') {if(ch=='-') f=-1;ch=getchar();}
while(ch>='0' && ch<='9') {x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
return x*f;
}
void init()
{
phi[1]=1;
for(int i=2;i<M;i++)
{
if(!b[i]) q[++q[0]]=i,phi[i]=i-1;
for(int j=1;j<=q[0] && (ll)q[j]*i<M;j++)
{
b[i*q[j]]=1;
if(!(i%q[j]))
{
phi[i*q[j]]=phi[i]*q[j]%modd;break;
}
phi[i*q[j]]=phi[i]*(q[j]-1)%modd;
}
}
for(int i=2;i<M;i++) phi[i]=phi[i]*i%modd;
for(int i=2;i<M;i++) phi[i]=(phi[i]+phi[i-1])%modd;
}
ll k(ll u)
{
return u*(u+1)%modd*ni2%modd;
}
ll cal(ll n)
{
if(n<M) return phi[n];
map<int,int>::iterator it=f.find(n);
if(it!=f.end()) return it->second;
ll las,re=0,now=n*(n+1)%modd*(n+n+1)%modd*ni6%modd;
for(ll i=2;i<=n;i=las+1)
{
las=n/(n/i);
re=(re+(k(las)-k(i-1)+modd)%modd*cal(n/i)%modd)%modd;
}
return f[n]=(now-re+modd)%modd;
}
int main()
{
init();puts("1");n=read();
printf("%lld\n",cal(n));
return 0;
}