Cod sursa(job #890643)
Utilizator | Data | 25 februarie 2013 10:56:21 | |
---|---|---|---|
Problema | Factorial | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("fact.in");
ofstream out("fact.out");
int const N=10;
int p,z,n,pow[N];
int main()
{
in>>p; pow[0]=1;
if(p==0){out<<"1\n";return 0;}
for(int i=1;i<N;i++)
pow[i]=5*pow[i-1];
int i;
while(z<p)
{
n+=5;i=1;
while(n%pow[i]==0)
{z++;i++;}
}
out<<n;
return 0;
}