Pagini recente » Cod sursa (job #153588) | Cod sursa (job #1531381) | Cod sursa (job #395104) | Cod sursa (job #2398908) | Cod sursa (job #2115020)
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int n;
int nrz(int x)
{
int rez=0,p=5;
while(p<x)
{
rez=rez+x/p;
p*=5;
}
if(!rez)
return 1;
return rez;
}
int bsearch(long long n)
{long long mij=0;
long long st=0;
long long dr=1000000000;
while(st<dr)
{
mij=(st+dr)/2;
if(nrz(mij)>n)
dr=mij;
else
st=mij+1;
}
return st;
}
int main()
{
f >> n;
if(n==0)
g <<"1";
else
g << bsearch(n)-5;
return 0;
}