题意
传送门 P2568 GCD
题解
p p p 代表 [ 1 , n ] [1,n] [1,n] 范围内的质数,求解 ∑ 1 ≤ p ≤ n ∑ 1 ≤ x ≤ n ∑ 1 ≤ y ≤ n [ g c d ( x , y ) = = p ] \sum\limits_{1\leq p\leq n}\sum\limits_{1\leq x\leq n}\sum\limits_{1\leq y\leq n}[gcd(x,y)==p] 1≤p≤n∑1≤x≤n∑1≤y≤n∑[gcd(x,y)==p] 即 ∑ 1 ≤ p ≤ n ∑ 1 ≤ x ≤ n / p ∑ 1 ≤ y ≤ n / p [ g c d ( x , y ) = = 1 ] \sum\limits_{1\leq p\leq n}\sum\limits_{1\leq x\leq n/p}\sum\limits_{1\leq y\leq n/p}[gcd(x,y)==1] 1≤p≤n∑1≤x≤n/p∑1≤y≤n/p∑[gcd(x,y)==1] 考虑到 x , y x,y x,y 值域的对称性, x ≤ y x\leq y x≤y 限制下互质的数对个数与 y ≤ x y\leq x y≤x 限制下的一致,重复计数的情况只有 ( 1 , 1 ) (1,1) (1,1)。对于 x ≤ y x\leq y x≤y 的情况,可以枚举 y y y,那么对于固定的 y y y,互质的数对个数为 ϕ ( y ) \phi (y) ϕ(y),则在固定质数的情况下,问题转化为求解欧拉函数的前缀和。设欧拉函数 [ 1 , i ] [1,i] [1,i] 的前缀和为 s u m i sum_i sumi,则答案为 ∑ 1 ≤ p ≤ n ( 2 × s u m [ n / p ] − 1 ) \sum\limits_{1\leq p\leq n}(2\times sum[n/p]-1) 1≤p≤n∑(2×sum[n/p]−1)
#include <bits/stdc++.h>
using namespace std;
#define maxn 10000005
typedef long long ll;
int n, np, prime[maxn], minp[maxn], phi[maxn];
ll sum[maxn];
void sieve(int n)
{
phi[1] = 1;
for (int i = 2; i <= n; ++i)
{
if (minp[i] == 0)
prime[np++] = i, minp[i] = i, phi[i] = i - 1;
for (int j = 0; j < np && i * prime[j] <= n; ++j)
{
int k = i * prime[j];
minp[k] = prime[j];
if (minp[i] == prime[j])
{
phi[k] = prime[j] * phi[i];
break;
}
else
phi[k] = (prime[j] - 1) * phi[i];
}
}
for (int i = 1; i <= n; ++i)
sum[i] = sum[i - 1] + phi[i];
}
int main()
{
cin >> n;
sieve(n);
ll res = 0;
for (int i = 0; i < np; ++i)
res += (sum[n / prime[i]] << 1) - 1;
cout << res << endl;
return 0;
}