P2568 GCD（莫比乌斯反演）

题目传送门

题意：

给你一个正整数$n(1\le n\le 10^7)$，求出满足$1\le x\le n,1\le y\le n，gcd(x,y)\in prime$的$x,y$的对数。

思路一：莫比乌斯反演

$$\begin{gathered} \begin{array}{rl} \\ ans& =\sum _{i=1}^n\sum _{j=1}^n[gcd(i,j)\in prime]\\ & =\sum _{p\in prime}\sum _{i=1}^n\sum _{j=1}^n[gcd(i,j)=p]\\ & =\sum _{p\in prime}\sum _{i=1}^{\lfloor \frac{n}{p}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{p}\rfloor }[gcd(i,j)=1]\\ & =\sum _{p\in prime}\sum _{i=1}^{\lfloor \frac{n}{p}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{p}\rfloor }\sum _{d|(i,j)}\mu (d)\\ & =\sum _{p\in prime}\sum _{d=1}^{\lfloor \frac{n}{p}\rfloor }\mu (d)\lfloor \frac{\lfloor \frac{n}{p}\rfloor }{d}\rfloor \ast \lfloor \frac{\lfloor \frac{n}{p}\rfloor }{d}\rfloor \end{array} \end{gathered}$$

质数的枚举次数可以用质数密度来估算，即$O(\frac{n}{\ln x})$，后面的式子用除法分块在$O(\sqrt{\frac{n}{p}})$的复杂度求，均摊下来，$O(能过)$。

$Code$

// Author : ACfunhsl
// Time : 2021/5/17 14:13:11
#define int long long
const int N = 1e7+50;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
bool ok[N];
int p[N],cnt=0,mu[N];
void euler()
{
	mu[1] = 1;
	for(int i=2;i<N;i++)
	{
		if(!ok[i])
		{
			p[++cnt] = i;
			mu[i] = -1;	
		}
		for(int j=1;j<=cnt&&i*p[j]<N;j++)
		{
			ok[i*p[j]] = 1;
			if(i%p[j]==0)
			{
				mu[i*p[j]] = 0;
				break;
			}
			else mu[i*p[j]] = -mu[i];
		}
	}
	for(int i=1;i<N;i++)
		mu[i] += mu[i-1];
}
int k;
int cal(int n)
{
	int res = 0;
	n/=k;
	for(int l=1,r;l<=n;l=r+1)
	{
		r = n/(n/l);
		res += (n/l)*(n/l)*(mu[r] - mu[l-1]);
	}
	return res;
}
signed main()
{
	euler();
	int n;
	cin>>n;
	int res = 0;
	for(int i=1;i<=cnt&&p[i]<=n;i++)
	{
		k = p[i];
		res += cal(n);
	}
	cout<<res<<endl;
	return 0;
}

思路二：欧拉函数

$$\begin{gathered} \begin{array}{rl} \\ ans& =\sum _{i=1}^n\sum _{j=1}^n[gcd(i,j)\in p]\\ & =\sum _{p\in prime}\sum _{i=1}^n\sum _{j=1}^n[gcd(i,j)=p]\\ & =\sum _{p\in prime}\sum _{i=1}^{\lfloor \frac{n}{p}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{p}\rfloor }[gcd(i,j)=1]\\ & =\sum _{p\in prime}\left(\left(2\ast \sum _{i=1}^{\lfloor \frac{n}{p}\rfloor }\sum _{j=1}^i[gcd(i,j)=1]\right)-1\right)\\ & =\sum _{p\in prime}\left(2\ast \sum _{i=1}^{\lfloor \frac{n}{p}\rfloor }\phi (i)-1\right)\end{array} \end{gathered}$$

$Code$

// Author : ACfunhsl
// Time : 2021/5/17 14:13:11
#define int long long
const int N = 1e7+50;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
bool ok[N];
int p[N],cnt=0,phi[N];

void euler()
{
	phi[1] = 1;
	for(int i=2;i<N;i++)
	{
		if(!ok[i])
			p[++cnt] = i,phi[i] = i-1;
		for(int j=1;j<=cnt&&i*p[j]<N;j++)
		{
			ok[i*p[j]] = 1;
			if(i%p[j]==0)
			{
				phi[i*p[j]] = phi[i] * p[j];
				break;
			}
			else phi[i*p[j]] = phi[i] * phi[p[j]];
		}
	}
	for(int i=2;i<N;i++)
		phi[i] += phi[i-1];
}
signed main()
{
	euler();
	int n;
	cin>>n;
	int res = 0;
	for(int i=1;i<=cnt&&p[i]<=n;i++)
	{
		res += 2 * phi[n/p[i]] -1;
	}
	cout<<res<<endl;
	return 0;
}