bzoj 4916: 神犇和蒟蒻

题意：求 $$\sum_{n}^i\mu(i^2)和\sum_{n}^i\phi(i^2)$$

题解

我个大SB竟然没有反应过来第一问就是1……
只要求第二问。
杜教筛。

$$\sum_{n}^i\sum_{d|i}^d\phi(d)i=\sum_{n}^ii^2=\frac{n(n+1)(2n+1)}{6}$$
$$\sum_{n}^i\sum_{d|i}^d\phi(d)i=\sum_{n}^i\sum_{d|i}^d\phi(d)*d*\frac{i}{d}=\sum_{n}^k\sum_{\lfloor\frac{n}{k}\rfloor}^d\phi(d)*d*k=\sum_{n}^kk*sum(\lfloor\frac{n}{k}\rfloor)$$
因为有 $\phi(i^2)=\phi(i)i$
所以就不难杜教筛了。
code：

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<map>
#include<algorithm>
#define LL long long
using namespace std;
const LL inv6=166666668,inv2=500000004,mod=1000000007;
int n,prime[5000010],pr;
bool v[5000020];
LL phi[5000010];
map<int,LL> SUM;
void pre()
{
    pr=0;phi[1]=1LL;
    memset(v,true,sizeof(v));
    for(int i=2;i<=5000000;i++)
    {
        if(v[i]) prime[++pr]=i,phi[i]=i-1;
        for(int j=1;j<=pr&&i*prime[j]<=5000000;j++)
        {
            v[i*prime[j]]=false;
            if(i%prime[j]==0){phi[i*prime[j]]=phi[i]*prime[j];break;}
            phi[i*prime[j]]=phi[i]*(prime[j]-1);
        }
    }
    for(int i=1;i<=5000000;i++)
        phi[i]=phi[i]*i%mod,phi[i]=(phi[i]+phi[i-1])%mod;
}
LL sum(int l,int r){return (LL)(l+r)%mod*(LL)(r-l+1)%mod*inv2%mod;}
LL sum_2(int n){return (LL)n*(LL)(n+1)%mod*(LL)(2*n+1)%mod*inv6%mod;}
LL solve(int n)
{
    if(n<=5000000) return phi[n];
    if(SUM[n]) return SUM[n];
    LL ans=sum_2(n);
    int j;
    for(int i=2;i<=n;i=j+1)
    {
        j=n/(n/i);
        ans=(ans-solve(n/i)*sum(i,j)%mod)%mod;
    }
    SUM[n]=ans;
    return ans;
}
int main()
{
    pre();SUM.clear();
    scanf("%d",&n);
    printf("1\n%lld",(solve(n)+mod)%mod);
}