Pagini recente » Istoria paginii runda/simulare-oji-xutzu | Cod sursa (job #1139876) | Cod sursa (job #1771362) | Istoria paginii runda/incercare1/clasament | Cod sursa (job #1253348)
#include <fstream>
using namespace std;
ifstream in("fact.in");
ofstream out("fact.out");
long long n;
int nr0(int p)
{
int cnt=1;
int s=0;
while(p/cnt>0)
{
cnt=cnt*5;
s=s+p/cnt;
}
return s;
}
int main()
{
int p;
in>>p;
long long x = 100000000000000000/2;
long long st=1,dr=x*2,mij=x;
while(st<=dr)
{
mij=(st+dr)/2;
if(nr0(mij)==p)
{
n=mij;
break;
}
else if(nr0(mij)<p)
st=mij+1;
else
dr=mij-1;
}
if(n!=0)
while(n>0 && nr0(n)==p)
n--;
out<<n+1;
return 0;
}