bzoj4916: 神犇和蒟蒻（杜教筛）

Description
很久很久以前，有一只神犇叫yzy;
很久很久之后，有一只蒟蒻叫lty;
Input
请你读入一个整数$N;1<=N<=10^9,A、B$模$10^9+7$;
Output
请你输出一个整数$A={\sum }_{i=1}^N\mu (i^2)$
请你输出一个整数$B={\sum }_{i=1}^N\phi (i^2)$
Sample Input
1
Sample Output
1
1

---

$solution$：
（第一问我不会做啊（咳咳）
第二问是$bzoj3944$的加强版
不难发现$\varphi (i{)}^2=i\ast \varphi (i)$
直接和$g=\epsilon$做卷积就可以得到$h(n)=n^2$

#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define rept(i,x) for(int i = linkk[x],y = e[i].y;i;i = e[i].n,y = e[i].y)
#define P pair<int,int>
#define Pil pair<int,ll>
#define Pli pair<ll,int>
#define Pll pair<ll,ll>
#define pb push_back 
#define pc putchar
#define mp make_pair
#define file(k) memset(k,0,sizeof(k))
#define ll long long
int rd()
{
	int num = 0;char c = getchar();bool flag = true;
	while(c < '0'||c > '9') {if(c == '-') flag = false;c = getchar();}
	while(c >= '0' && c <= '9') num = num*10+c-48,c = getchar();
	if(flag) return num;else return -num;
}
const int N = 1e6;
const int p = 1e9+7;
int n,inv,inv2;
int prime[N+10],phi[N+10],v[N+10];
inline int mul(int a,int b){return 1ll*a*b%p;}
inline int calc(int a,int b){return (a+=b)>=p?a-=p:a;}
inline int del(int a,int b){return (a-=b)<0?a+=p:a;}
inline int ksm(int a,int x){int now=1;for(;x;x>>=1,a=1ll*a*a%p)if(x&1)now=1ll*now*a%p;return now;}
unordered_map<int,int>Phi;
void pre()
{
	phi[1] = 1;
	rep(i,2,N)
	{
		if(!v[i]) prime[++prime[0]] = i,v[i] = i,phi[i] = i-1;
		rep(j,1,prime[0])
		{
			if(v[i] < prime[j] || i*prime[j] > N) break;
			v[i*prime[j]] = prime[j];
			phi[i*prime[j]] = phi[i] * (i%prime[j]?prime[j]-1:prime[j]);
			if(i%prime[j] == 0) break; 
		}
	}
	rep(i,1,N) phi[i] = mul(phi[i],i),phi[i] = calc(phi[i],phi[i-1]);
}
int get(int i,int j)
{
	return mul(inv2,mul(i+j,j-i+1));
}
int solve(int n)
{
	if(n<=N) return phi[n];
	if(Phi.find(n) != Phi.end()) return Phi[n];
	int now = mul(n,mul(n+1,mul(2*n+1,inv))),i=2;
	while(i <= n)
	{
		int j = n/(n/i);
		now = del(now,mul( get(i,j) , solve(n/i) ) );
		i = j+1;
	}
	Phi[n] = now;
	return now;
}
int main()
{
	pre();inv = ksm(6,p-2);inv2 = ksm(2,p-2);
	int x = rd();
	printf("1\n%d\n",solve(x));
	return 0;
}