Cod sursa(job #29994)
Utilizator | Data | 12 martie 2007 09:56:33 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include<fstream>
#include<math.h>
using namespace std;
long int fact(long int x)
{
long int i,prod=1;
for(i=1;i<=x;i++)
prod=prod*i;
return prod;
}
int main()
{
long int n,prod,i,aux=-1,p,gasit=0;
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
n=5*p;
i=pow(10,p);
prod=fact(n);
if((prod%i==0)&&((prod%i)%10!=0))
aux=n;
g<<aux;
f.close();
g.close();
return 0;
}