Pagini recente » Cod sursa (job #712288) | Cod sursa (job #2823318) | Cod sursa (job #189212) | Cod sursa (job #1224958) | Cod sursa (job #3258892)
#include <fstream>
using namespace std;
ifstream fin("frac.in");
ofstream fout("frac.out");
const int nr=100000000000000000;
long long v[100000];
int main()
{
long long n, p, ii=0;
fin >> n >> p;
if(n%2==0)
{
ii++;
v[ii]=2;
while(n%2==0&&n>1)
{
n/=2;
}
}
int k=3;
while(n>1)
{
if(n%k==0)
{
ii++;
v[ii]=k;
while(n%k==0)
{
n/=k;
}
}
k+=2;
}
long long st=1, dr=nr, mid, cmid;
while(st<=dr)
{
mid=(st+dr)/2;
cmid=mid;
bool ok=1;
for(int i=1; i<=ii; i++)
{
if(mid%v[i]==0)
{
ok=0;
}
cmid-=mid/v[i];
for(int j=1; j<i; j++)
{
if(j!=i)
cmid+=mid/(v[j]*v[i]);
}
}
if(cmid==p&&ok==1)
{
fout << mid;
break;
}
else if(cmid>=p)
dr=mid-1;
else
st=mid+1;
}
return 0;
}