容斥定理+二分 0Ms
#include<stdio.h>
#include<iostream>
#include<math.h>
using namespace std;
const long long inf=(long long)1<<63-2;
int a[30],N,M;
long long ret,K;
void dfs(int s,int b,int dep,long long m)
{
if(dep%2) ret+=m/b;
else if(dep>1) ret-=m/b;
for(int i=s;i<N;i++)
dfs(i+1,b*a[i],dep+1,m);
}
void dec(int M)
{
int n=M; N=0;
for(int i=2;i<=(int)sqrt(1.0*M);i++)
{
if(n%i==0)
{
a[N++]=i;
while(n%i==0) n/=i;
}
}
if(n!=1) a[N++]=n;
}
int gcd(long long a,int b)
{
return b==0?a:gcd(b,a%b);
}
int main()
{
// freopen("test.txt","r",stdin);
while(scanf("%d%lld",&M,&K)!=EOF)
{
long long l=1,r=inf,mid,ans=0;
dec(M);
while(l<=r)
{
mid=(l+r)>>1;
ret=0; dfs(0,1,0,mid);
ret=mid-ret;
if(ret>K) r=mid-1;
else if(ret==K)
{
for(long long i=mid; ;i--)
{
if(gcd(i,M)==1)
{
ans=i;
break;
}
}
break;
}
else l=mid+1;
}
printf("%lld\n",ans);
}
return 0;
}