Pagini recente » Cod sursa (job #2084169) | Cod sursa (job #288939) | Cod sursa (job #2305971) | Cod sursa (job #1155826) | Cod sursa (job #245782)
Cod sursa(job #245782)
#include <stdio.h>
long long pow(long long n,long long p)
{
long long s=1;
while(p)
{
if (p%2)
s=s*n;
n=n*n;
p/=2;
}
return s;
}
long long factorial(long long p)
{
long long i,s=1;
for (i=1; i<=p; i++)
s*=i;
return s;
}
int main()
{
freopen("gfact.in","r",stdin);
freopen("gfact.out","w",stdout);
long long p,q,i,a;
scanf("%lld%dlld",&p,&q);
for (i=1; i<=200; i++)
if (factorial(i)%pow(p,q)==0)
{
printf("%lld",i);
break;
}
return 0;
}