Pagini recente » Cod sursa (job #2236505) | Cod sursa (job #636531) | Cod sursa (job #1554357) | Cod sursa (job #408616) | Cod sursa (job #405475)
Cod sursa(job #405475)
#include<fstream.h>
long long n,i,k,j,p,nr,prod,x;
int factorial(int n)
{ prod=1;
for(i=1;i<=n;i++)
prod=prod*i;
return (prod);
}
int verif()
{
k=prod; nr=0;
while(k!=0 && k%10==0)
{ k=k/10; nr++; }
if(p==nr)
return 1;
else
return 0;
}
int oprire()
{ if(nr>=p)
return 1;
else
return 0;
}
int main()
{ ifstream f("fact.in");
ofstream g("fact.out");
f>>p; n=9;
while(j==0 && x==0)
{ factorial(n);
j=verif();
if(j==1)
g<<n;
x=oprire();
n++;
}
if(j==0)
g<<"-"<<1;
f.close(); g.close();
}