Pagini recente » Cod sursa (job #2480636) | Cod sursa (job #1388606) | Cod sursa (job #1446496) | Cod sursa (job #1437100) | Cod sursa (job #3168319)
#include <bits/stdc++.h>
using namespace std;
#ifndef LOCAL
string name="frac";
ifstream in(name+".in");
ofstream out(name+".out");
#define cin in
#define cout out
#endif // LOCAL
#define int long long
const int MV = 5e5+6;
const int MB = 61;
int n,p;
vector<int> pr;
vector<int> divs;
int c[MV];
void ciur()
{
pr.push_back(2);
for(int i=3;i<MV;i+=2)
{
if(c[i]==0)
{
pr.push_back(i);
for(int j=i*i;j<MV;j+=i)
{
c[j]=1;
}
}
}
}
int xprim(int x)
{
int mm=(1<<divs.size());
int ans=x;
for(int i=1;i<mm;i++)
{
int me=1, mob=-1;
for(int j=0;(1<<j)<=i;j++)
{
if((i>>j)&1) me*=divs[j], mob=-mob;
}
ans=ans-(x/me)*mob;
}
return ans;
}
int32_t main()
{
ciur();
cin>>n>>p;
int aux=n;
for(auto e:pr)
{
bool ok=0;
while(aux%e==0)
{
ok=1;
aux/=e;
}
if(ok) divs.push_back(e);
}
int st=1, dr=(1ll<<MB);
int mid=(st+dr)/2;
while(st!=dr)
{
if(xprim(mid)<p) st=mid+1;
else dr=mid;
mid=(st+dr)/2;
}
cout<<mid<<'\n';
return 0;
}