Cod sursa(job #2246710)
Utilizator | Data | 27 septembrie 2018 14:01:59 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long int p, n=1, c=1;
int main()
{
f>>p;
if(p==0)
{
cout<<1;
return 0;
}
int i=1;
for(int j=0;j<p;j++) c=c*5;
while(n)
{
n=n*i;
if(n%c==0) break;
i++;
}
g<<i;
f.close();
g.close();
return 0;
}