Pagini recente » Cod sursa (job #174453) | Cod sursa (job #1722510) | Cod sursa (job #2295793) | Cod sursa (job #1955593) | Cod sursa (job #25565)
Cod sursa(job #25565)
#include<fstream.h>
long n,i,b,x,j,nq,p=1,nr,gasit;
long fact(long n)
{
if(!n)
return 1;
return n*fact(n-1);
}
long transform(long n10,long q)
{
long nq=0,p=1;
while(n10)
{
nq=nq+p*(n10%q);
n10=n10/q;
p=p*10;
}
return nq;
}
int main()
{
ifstream f("zero2.in");
ofstream g("zero2.out");
for(i=1;i<=10;i++)
{
p=1;
f>>n>>b;
x=1;
gasit=0;
nr=0;
for(j=1;j<=n;j++)
x=x*fact(j);
nq=transform(x,b);
while(!gasit)
{
if(nq%10==0)
nr++;
else
gasit=1;
nq=nq/10;
}
g<<nr<<"\n";
}
f.close();
g.close();
return 0;
}