Description
–
给定整数N,求1<=x,y<=N且Gcd(x,y)为素数的
数对(x,y)有多少对.
1<=N<=10^7
Solution
我们可以枚举一个质数p,这样就可以求gcd(x/p,y/p)=1的数量,那么筛一个欧拉函数表的前缀和即可
注意到题目中(2,1)与(1,2)不同,要算两次,而gcd(1,1)只用算1次
一开始错是因为没开ll,顺便复习一波线性筛
Code
#include <stdio.h>
#include <string.h>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
#define fill(x,t) memset(x,t,sizeof(x))
typedef long long ll;
const int N=10000005;
bool not_prime[N];
int prime[N],phi[N];
ll sum[N];
int main(void) {
int n; scanf("%d",&n);
phi[1]=1;
not_prime[1]=1;
rep(i,2,N-1) {
if (!not_prime[i]) {
prime[++prime[0]]=i;
phi[i]=i-1;
}
rep(j,1,prime[0]) {
if (i*prime[j]>=N) break;
not_prime[i*prime[j]]=1;
if (i%prime[j]==0) {
phi[i*prime[j]]=phi[i]*prime[j];
break;
}
phi[i*prime[j]]=phi[i]*(prime[j]-1);
}
}
sum[1]=phi[1];
rep(i,2,n) sum[i]=sum[i-1]+phi[i];
ll ans=0;
rep(i,1,prime[0]) {
if (prime[i]>n) break;
ans+=sum[n/prime[i]]*2-1;
}
printf("%lld\n", ans);
return 0;
}