Cod sursa(job #2157078)
| Utilizator | Data | 9 martie 2018 11:00:40 | |
|---|---|---|---|
| Problema | Factorial | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
int p,i,d,k=0,n,m;
f>>p;
if(p==0)
{
g<<1;
return 0;
}
else
{
n=5*p;
while(d!=p)
{for(i=5;i<=n;i+=5)
{m=i;
while(m%5==0)
{
m=m/5;
k++;
}
}
d=k;
if(d>p)
{n=n-5;
k=0;
}
else if(d<p)
{
g<<-1;
return 0;
}
}
g<<n;
}
return 0;
}
