Pagini recente » Cod sursa (job #2553788) | Cod sursa (job #2546292) | Cod sursa (job #230380) | Cod sursa (job #2553813) | Cod sursa (job #2209275)
#include <fstream>
using namespace std;
int putere(long long mid,int p,int q)
{
int ci;
for(int i=2;i<=mid;i++)
{
ci=i;
while(ci%p==0)
{
q--;
ci/=p;
}
}
return q;
}
int main()
{
ifstream in ("gfact.in");
ofstream out ("gfact.out");
int st=1,p,q;
long long mid,rez,dr;
in>>p>>q;
dr=p*q;
while(st<=dr)
{
mid=(st+dr)/2;
if(putere(mid,p,q)>0)
st=mid+1;
else
{
rez=mid;
dr=mid-1;
}
}
out<<rez;
return 0;
}