Cod sursa(job #414915)
Utilizator | Data | 10 martie 2010 18:32:23 | |
---|---|---|---|
Problema | Factorial | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.32 kb |
#include<iostream.h>
#include<fstream.h>
ifstream f("fact.in");
ofstream g("fact.out");
int main()
{
int p,ok=0,n,k=0,cp;
f>>p;
for(n=1;ok==0 && n>0;n++)
{
cp=n;
while(cp%5==0)
{
k++;
cp=cp/5;
}
if(k>=p)
ok=n;
}
if(k!=p) g<<-1;
else g<<ok;
f.close();
g.close();
return 0;
}