Pagini recente » Cod sursa (job #2574828) | Cod sursa (job #720468) | Cod sursa (job #2104463) | Cod sursa (job #934715) | Cod sursa (job #1087533)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int n;
int zero(int x)
{
int i,k;
k=0;
for(i=5;i<=x;i*=5)
k+=x/i;
return k;
}
int search(int st, int dr)
{
int m,x;
while(st<=dr)
{
m=(st+dr)/2;
x=zero(m);
if(x==n)
return m;
if(n>x)
st=m+1;
else
dr=m-1;
}
}
int main()
{
fin>>n;
int i;
i=search(1,100000000);
while(i%5!=0)
i--;
if(n==0)
i=1;
if(i)
fout<<i<<"\n";
else
fout<<-1<<"\n";
fin.close();
fout.close();
return 0;
}