Pagini recente » Cod sursa (job #1545636) | Cod sursa (job #160707) | Cod sursa (job #3180680) | Cod sursa (job #1798137) | Cod sursa (job #2411670)
#include <iostream>
#include <fstream>
#define Max 20000000
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int p,n=0,M=-1;
/*int Calcul(int nr)
{int k=0,pr=1;
for(int i=1;i<=nr;i++)
{
pr*=i;
if(pr%10==0)
{
k++;
pr/=10;
}
}
return k;
}*/
int Calcul(long n)
{
int nr=0;
for(int i=5; n/i>=1; i=i*5)
nr=nr+n/i;
return nr;
}
int Cautare(int in, int sf)
{
if(in>sf)
return M;
else
{
int mij=(in+sf)/2;
int n=Calcul(mij);
if(p==n)
{
M=mij;
Cautare(in,mij-1);
}
else
if(n>p)
return Cautare(in,mij-1);
else
return Cautare(mij+1,sf);
}
}
int main()
{f>>p;
if(p==0)
g<<1;
else
g<<Cautare(1,p*10);
return 0;
}