Pagini recente » Cod sursa (job #77337) | Cod sursa (job #510279) | Cod sursa (job #1882792) | Cod sursa (job #2044407) | Cod sursa (job #2415389)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("fact.in");
ofstream out("fact.out");
int p,k=-1;
long fact(long n)
{
long int nr=0;
for (int i=5; i<=n; i=i*5)
{
nr=nr+n/i;
}
return nr;
}
long bin(int s,int d)
{
if(s>d)return k;
else
{
int mij=(s+d)/2;
long nrcif0=fact(mij);
if(nrcif0==p)
{
k=mij;
return bin(s,mij-1);
}else if(nrcif0>p)
return bin(s,mij-1);
else
return bin(mij+1,d);
}
}
int main()
{
in>>p;
if(p==0)
out<<"1";
else
out<<bin(1,p*10);
return 0;
}