Pagini recente » Cod sursa (job #2517394) | Cod sursa (job #2263354) | Cod sursa (job #2442582) | Cod sursa (job #15430) | Cod sursa (job #2549679)
#include <fstream>
using namespace std;
ifstream cin("gfact.in");
ofstream cout("gfact.out");
long long power(long long p,long long n)
{
long long s=0,cp=p;
while(p<=n)
{
s+=n/p;
p*=cp;
}
return s;
}
long long solve(long long p,long long q)
{
long long st,dr,m;
st=0;
dr=60000000000000;
bool ok=1;
while(st<=dr&&ok)
{
m=(st+dr)/2;
if(power(p,m)>q)
dr=m-1;
if(power(p,m)<q)
st=m+1;
if(power(p,m)==q)
{
ok=0;
st=m;
}
}
return st-st%p;
}
int main()
{
long long p,q,d=2,rez=0,pow;
cin>>p>>q;
cout<<solve(p,q);
return 0;
}