Pagini recente » Cod sursa (job #714977) | Cod sursa (job #469766) | Cod sursa (job #321282) | Cod sursa (job #257314) | Cod sursa (job #1156570)
#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)
{
div=div/5;
s=s+div;
}
return s;
}
int cauta(int li, int ls)
{
int m;
if(li==ls)
return -1;
m=(li+ls)/2;
if(zero(m)==k)
{
if(zero(m-4)==k)
return m-4;
else
if(zero(m-3)==k)
return m-3;
else
if(zero(m-2)==k)
return m-2;
else
if(zero(m-1)==k)
return m-1;
else
return m;
}
else
if(zero(m)<k)
return cauta(m+1,ls);
else
return cauta(li,m-1);
}
int main()
{
int m;
in>>k;
if(k==0)
out<<1;
else
{
out<<cauta(0,k*10);
}
}