Cod sursa(job #538768)
Utilizator | Data | 21 februarie 2011 21:39:06 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | contest- | Marime | 0.36 kb |
#include<fstream.h>
long long int nr,k;
int main(){
long long int p,i,prod=1;
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
if(p==0){g<<1;k=1;}
for(i=1;i<=100000000 && k!=1;i++){
prod=prod*i;
if(prod%10==0){
prod=prod/10;
nr++; }
if(nr==p){
g<<i;
break; } }
if(nr!=p){g<<"-1";}
f.close();
g.close();
return 0;
}