Cod sursa(job #687140)
Utilizator | Data | 22 februarie 2012 09:43:31 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
long ok,i,j,p,m,k;
f>>p;
ok=0;
i=0;k=1;
while(ok==0 && i<1000000){
i++;
k*=i;
m=k;
while(m%10==0){j++;
m/=10;}
if(j==p){ok=1;
g<<i;
break;}
}
if(ok==0)g<<-1;
f.close();
g.close();
return 0;
}