洛谷P2568 GCD 欧拉函数+线筛

---

洛谷P2568 GCD

---

标签

• 欧拉函数

---

前言

---

简明题意

• 给定整数N，求1<=x,y<=N且Gcd(x,y)为素数的数对(x,y)有多少对.

---

思路

• 根据套路，可以把上面的式子换成：（原理）
  $$\sum _{p:[1,n]内所有素数}\sum _{i=1}^n\sum _{j=1}^n[gcd(i,j)==p]$$
  $$=\sum _{p:[1,n]内所有素数}\sum _{i=1}^{\frac{n}{p}}\sum _{j=1}^{\frac{n}{p}}[gcd(i,j)==1]$$
  自己举一些数据，会发现
  $$=\sum _{i=1}^{\frac{n}{p}}\sum _{j=1}^{\frac{n}{p}}[gcd(i,j)==1]=2pre\varphi (\frac{n}{p})-1$$
  所以原式就成了
  $$\sum _{p:[1,n]内所有素数}(2pre\varphi (\frac{n}{p})-1)$$

---

注意事项

• 自己举例子可以发现$$\sum _{i=1}^{\frac{n}{p}}\sum _{j=1}^{\frac{n}{p}}[gcd(i,j)==1]=2pre\varphi (\frac{n}{p})-1$$

---

总结

• 熟记以下套路
  $$\sum _{i=1}^n\sum _{j=1}^n[gcd(i,j)==p]=\sum _{i=1}^{\frac{n}{p}}\sum _{j=1}^{\frac{n}{p}}[gcd(i,j)==1]=2pre\varphi (\frac{n}{p})-1$$
  $$\sum _{i=1}^{\frac{n}{p}}[gcd(i,\frac{n}{p})==1]=pre\varphi (\frac{n}{p})(\frac{n}{p}向下取整)$$

---

AC代码

#include<cstdio>

const int maxn = 1e7 + 10;

int n;

bool no_prime[maxn];
int prime[maxn], phi[maxn];
int shai(int n)
{
	phi[1] = 1;
	int cnt = 0;
	for (int i = 2; i <= n; i++)
	{
		if (!no_prime[i])
			prime[++cnt] = i, phi[i] = i - 1;
		for (int j = 1; j <= cnt && prime[j] * i <= n; j++)
		{
			no_prime[prime[j] * i] = 1;
			phi[prime[j] * i] = (i % prime[j] == 0) ? phi[i] * prime[j] : phi[i] * (prime[j] - 1);

			if (i % prime[j] == 0) break;
		}
	}
	return cnt;
}

long long pre[maxn];
void solve()
{
	scanf("%d", &n);
	int cnt = shai(n);
	for (int i = 1; i <= n; i++)
		pre[i] = pre[i - 1] + phi[i];

	long long ans = -cnt;
	for (int i = 1; i <= cnt; i++)
		ans += 2 * pre[n / prime[i]];
			
	printf("%lld", ans);
}

int main()
{
	solve();
	return 0;
}