参考两篇博客:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6+5;
int zhi[N],pri[N],tot,m,id1[N],id2[N];
ll n,p,w[N],h[N],Sqr;
ll Pr[N];
int cnt;
bool jud[N];
void Sieve(int n){
zhi[1]=1;
for (int i=2;i<=n;++i){
if (!zhi[i]) pri[++tot]=i;
for (int j=1;i*pri[j]<=n;++j){
zhi[i*pri[j]]=1;
if (i%pri[j]==0) break;
}
}
}
ll S(ll x,int y){
if (x<=1||pri[y]>x) return 0;
int k = (x<=Sqr)?id1[x]:id2[n/x];
ll res=(h[k]-(y-1)); //考虑质数的情况
for(int i = 1; i <= cnt; i++){
if(Pr[i] > pri[y-1] && Pr[i] <= w[k]) --res; //考虑质数的情况
}
for (int i=y;i<=tot&&1ll*pri[i]*pri[i]<=x;++i){
if(jud[pri[i]] == 0) res += S(x/pri[i], i+1); //考虑和数的情况
}
return -res;
}
int main(){
scanf("%lld%lld",&n,&p);
Sqr=sqrt(n+0.5); Sieve(Sqr);
for (ll i=1,j;i<=n;i=j+1){
j=n/(n/i);w[++m]=n/i;
if (w[m]<=Sqr) id1[w[m]]=m;
else id2[n/w[m]]=m;
h[m]=w[m]-1;
}
for (int j=1;j<=tot;++j)
for (int i=1;i<=m&&1ll*pri[j]*pri[j]<=w[i];++i){
int k = (w[i]/pri[j]<=Sqr)? id1[w[i]/pri[j]] : id2[n/(w[i]/pri[j])];
h[i] = h[i]-h[k]+j-1;
}
ll x = p; bool flag = 0;
for(int i = 2; 1LL*i*i <= x ; i++){
if(x %(1LL*i*i) == 0){
flag = 1;
break;
}
if(x % i == 0){
while(x % i == 0) x /= i;
Pr[++cnt] = i;
jud[i] = 1;
}
}
if(x != 1){
Pr[++cnt] = x;
if(x <= Sqr) jud[x] = 1;
}
if(flag){
printf("0\n");
return 0;
}
ll ans = S(n,1) + 1;
if(cnt&1) ans *= -1;
printf("%lld\n",ans);
return 0;
}