Pagini recente » Cod sursa (job #1103807) | Cod sursa (job #3247481) | Cod sursa (job #1842114) | Cod sursa (job #396045) | Cod sursa (job #27028)
Cod sursa(job #27028)
#include<fstream.h>
#include<math.h>
int main()
{ long n,x,q=0,i,k=1,nr=0;
ifstream f("fact.in");
ofstream g("fact.out");
f>>n;x=n;
while(x>=5) {k++;x/=5;}
while(k>1)
{q=pow(5,k);
if(n*5>25) {for(i=n*5-q;i>5;i-=q)
if(i%q==0)
if(i/q%5!=0)
nr++;}
else
{for(i=n*5;i>5;i-=q)
if(i%q==0)
if(i/q%5!=0)
nr+=k;}
k--;
}
g<<(n-nr)*5;
f.close();
g.close();
return 0;
}