Pagini recente » Cod sursa (job #2525003) | Borderou de evaluare (job #1062331) | Borderou de evaluare (job #966954) | Cod sursa (job #959321) | Cod sursa (job #490213)
Cod sursa(job #490213)
#include <fstream>
using namespace std;
ifstream in ("fact.in");
ofstream out ("fact.out");
int factorial (int n)
{
int r=0,i;
for (i=5;i<=n;i*=5)
r+=n/i;
return r;
}
int bsearch (int x)
{
int i,step=1<<26;
for (i=0;step;step>>=1)
if (factorial(i+step)<x)
i+=step;
return i+1;
}
int main()
{
int p;
in>>p;
out<<bsearch(p)<<"\n";
return 0;
}