Cod sursa(job #1665914)
| Utilizator | Data | 27 martie 2016 14:41:48 | |
|---|---|---|---|
| Problema | Factorial | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
int factorial (int n)
{ int i,p=1,n;
for (i=1;i<=n;i++)
p*=i;
}
int main()
{ long P,p,s,n;
ifstream f("fact.in");
ofstream g("fact.out");
f>>P;
ok=1;
n=1;
while (ok!=0 && n<=100000000)
{
s=factorial (n);
p=pow(10,P)
if (s%p==0)
{
g<<n;
ok=0;
}
}
if(n>100000000)
g<<-1;
return 0;
}
