Pagini recente » Cod sursa (job #1142887) | Cod sursa (job #3275570) | Cod sursa (job #2449416) | Cod sursa (job #1458824) | Cod sursa (job #890669)
Cod sursa(job #890669)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("fact.in");
ofstream out("fact.out");
int const N=30;
long long 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;
}