Pagini recente » Istoria paginii runda/winner18.1/clasament | Borderou de evaluare (job #1742048) | Borderou de evaluare (job #2496882) | Infoarena Monthly 2014 - Solutii Runda 3 | Cod sursa (job #3152496)
#include <fstream>
using namespace std;
ifstream cin("gfact.in");
ofstream cout("gfact.out");
int main()
{
int p,q,d,x,n;
cin>>p>>q;
if(p%2==0)
d=max(p/2,2);
else
for(d=3;d*d<=p;d+=2)
if(p%d==0)
{
d=max(p/d,d);
break;
}
if(p%d!=0)
d=p;
p=0;
n=0;
while(n<q)
{
x=1;
n=0;
p+=d;
while(p>=x*d)
{
x*=d;
n+=p/x;
}
}
cout<<p;
return 0;
}