Pagini recente » Borderou de evaluare (job #2116727) | Cod sursa (job #263438) | Cod sursa (job #2280640) | Cod sursa (job #208885) | Cod sursa (job #279891)
Cod sursa(job #279891)
#include<iostream.h>
#include<math.h>
#include<fstream.h>
long long i,p,n,s,putere;
float r;
ifstream f("fact.in");
ofstream g("fact.out");
int factorial()
{
long f=1,k=0;
for(i=1;i<=n;i++)
f*=i;
while(f%10==0)
{f/=10;
k++;
}
if(k==p) return 1;
else return -1;
}
main()
{
f>>p;
if(p==0) g<<'1';
else{
while(s<p)
{
for(i=0;s<=p;i++)
s=(s*5)+1;
s=(s-1)/5;
n=n+pow(5,i-1);
p-=s;
s=0;
}
if(factorial()==1)
g<<n;
else g<<factorial();}
g.close();
}