Cod sursa(job #1195021)
Utilizator | Data | 5 iunie 2014 19:07:42 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
int nr0(long long int n)
{
int i=0;
while(n%10!=0)
{
if(n%10==0)
i++;
n=n/10;
}
return i;
}
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
int p,n=1,ok=0,i;
long long int fac=1;
f>>p;
while(ok==0)
{
for(i=1;i<=n;i++)
fac=fac*i;
if(nr0(fac)==p)
ok=1;
else
n++;
}
g<<n;
return 0;
}