Pagini recente » Cod sursa (job #1652854) | Istoria paginii runda/ultradp | Cod sursa (job #363645) | Cod sursa (job #332396) | Cod sursa (job #1156467)
#include<iostream>
#include<fstream>
using namespace std;
int k;
ifstream in("fact.in");
ofstream out("fact.out");
int zero(int m)
{
int div,s=0;
div=m;
while(div!=0)
{
div=div/5;
if(div!=0)
s=s+div;
}
return s;
}
int cauta(int li, int ls)
{
int m,a,b;
if(li<=ls)
{
m=(li+ls)/2;
a=cauta(li,m-1);
b=cauta(m+1,ls);
if(zero(m)==k)
return m;
else
if(zero(m)>k)
return a;
else
return b;
}
}
int main()
{
in>>k;
if(k==0)
out<<1;
else
{
out<<cauta(0,20000);
}
}