Cod sursa(job #228498)
Utilizator | Daniel Placinta pddd | Data | 7 decembrie 2008 13:29:25 |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include<iostream>
#include<fstream>
using namespace std;
long int i,x,n,p,nr;
unsigned long int fact(int n)
{
if(n==0) return 1;
else return n*fact(n-1);
}
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
if(p==0)
g<<"1";
for(i=1;i<=10000000;i++)
{
if(i%5==0)
{
nr=0;
x=fact(i);
while(x%10==0)
{
++nr;
x=x/10;
}
}
if (p==nr)
{
g<<i;
i=100000000;
}
}
f.close(); g.close(); return 0; }