时空限制 1000ms / 256MB
题目描述
给定整数N,求1<=x,y<=N且Gcd(x,y)为素数的数对(x,y)有多少对.
说明
1<=N<=10^7
题目分析
第一眼想到的是莫比乌斯反演,然而愉快地T飞了
仔细一想单词询问莫比乌斯反演的预处理确实挺费时的
考虑转化题意为对每个不大于n的素数p
求
1
≤
x
,
y
≤
⌊
n
p
⌋
1\leq x,y \leq \lfloor\frac{n}{p}\rfloor
1≤x,y≤⌊pn⌋内有多少个
(
x
,
y
)
(x,y)
(x,y)满足
g
c
d
(
x
,
y
)
=
=
1
gcd(x,y)==1
gcd(x,y)==1
即
a
n
s
=
∑
p
∈
p
r
i
m
e
∑
i
=
1
⌊
n
p
⌋
∑
j
=
1
⌊
n
p
⌋
[
g
c
d
(
i
,
j
)
=
1
]
=
∑
p
∈
p
r
i
m
e
(
s
u
m
[
⌊
n
p
⌋
]
∗
2
−
1
)
ans=\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[\lfloor\frac{n}{p}\rfloor]*2-1)
ans=∑p∈prime∑i=1⌊pn⌋∑j=1⌊pn⌋[gcd(i,j)=1]=∑p∈prime(sum[⌊pn⌋]∗2−1)
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<cstring>
#include<cstdio>
using namespace std;
typedef long long lt;
int read()
{
int f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9'){if(ss=='-')f=-1;ss=getchar();}
while(ss>='0'&&ss<='9'){x=x*10+ss-'0';ss=getchar();}
return f*x;
}
const int maxn=1e7+10;
int vis[maxn],prim[maxn],cnt;
lt phi[maxn],sum[maxn],ans;
void Phi(int n)
{
phi[1]=1;
for(int i=2;i<=n;++i)
{
if(!vis[i]) prim[++cnt]=i,phi[i]=i-1;
for(int j=1;j<=cnt;++j)
{
if(i*prim[j]>n) break;
vis[i*prim[j]]=1;
if(i%prim[j]==0){ phi[i*prim[j]]=phi[i]*prim[j]; break;}
else phi[i*prim[j]]=phi[i]*phi[prim[j]];
}
}
for(int i=1;i<=n;++i)
sum[i]=sum[i-1]+phi[i];
}
int main()
{
int n=read();
if(n==1){cout<<0;return 0;}
Phi(n);
for(int i=1;i<=cnt;++i)
ans+=sum[n/prim[i]]*2-1;
printf("%lld",ans);
return 0;
}