Cod sursa(job #675838)
Utilizator | Data | 8 februarie 2012 12:43:17 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.31 kb |
#include<iostream>
#include<fstream>
ifstream f("fact.in");
ofstream g("fact.out");
long p,n,k,p5;
int main()
{f>>p;
k=5;
if (p==0)g<<1;
for (n=10;n<=100000000;n+=5)
{while(n/k>0)
{p5=p5+n/k;
k=k*k;
}
if(p5==p)
{g<<n;break;}
else {k=5;p5=0;}
}
f.close();
g.close();
return 0;
}