Pagini recente » Cod sursa (job #2506188) | Cod sursa (job #2734130) | Cod sursa (job #615007) | Cod sursa (job #2932299) | Cod sursa (job #1515378)
#include<fstream>
#include<cmath>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
unsigned long long int a[1000001],p,k=25,nr=0,i,x,m=1,t=1;
int main()
{
fin>>p;
a[1]=1;
for(i=2;i<=900001;i++)
{
if(i*5%k!=0)
{
a[i]=a[i-1]+1;
}
else
{
a[i]=a[i-1]+1+t;
m++;
}
if(m==4)
{
t++;
k=k*5;
m=0;
}
}
for(i=1;i<=900001;i++)
{
if(a[i]==p)
x=i;
}
if(a[x]==p)
{
fout<<x*5;
}
else
{
fout<<-1;
}
}