Cod sursa(job #1928187)
Utilizator | Data | 15 martie 2017 22:11:14 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<fstream>
#include<math.h>
using namespace std;
int fact(int n)
{if(n==1)return 1;
else return n*fact(n-1);
}
int main()
{ifstream f("fact.in");
ofstream g("fact.out");
int p, i, ok;
f>>p;
ok=0;
i=1;
while(!ok){
if(fact(i)%((int)pow(10,p))==0)ok=1;
else i++;
}
if(p==0)g<<'1';
else if(i>1)g<<i;
else g<<'-1';
f.close();
g.close();
return 0;
}