Pagini recente » Cod sursa (job #2704001) | Cod sursa (job #2543720) | Cod sursa (job #1910491) | Cod sursa (job #432104) | Cod sursa (job #2660081)
#include <bits/stdc++.h>
using namespace std;
ifstream f ("factorial.in");
ofstream g ("factorial.out");
int n;
int p;
void citire ()
{
f>>n;
}
int fact(long long x)
{
int p=5;
int cont=0;
while(p<=x)
{
cont+=x/p;
p*=5;
}
return cont;
}
void rezolvare()
{
long long st=1;
long long dr=1000000000;
long long mij=(st+dr)/2;
while(st<=dr)
{
if(fact(mij)==n && fact(mij-1)<n)
{
g<<mij;
return ;
}
if(fact(mij)<n)
st=mij+1;
else
dr=mij-1;
mij=(st+dr)/2;
}
}
int main()
{
citire();
rezolvare();
return 0;
}