Pagini recente » Cod sursa (job #2948767) | Cod sursa (job #502558) | Cod sursa (job #691156) | Cod sursa (job #3261551) | Cod sursa (job #989755)
Cod sursa(job #989755)
#include<fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long p,c;
int put(int m)
{
int n=5,z=0;
while(n<=m)
{
z=z+m/n;
n*=5;
}
return z;
}
int caut(int a,int b,int k)
{
int i,j;
i=(a+b)/2;
printf("%d\n",i);
if(a>b){
return -1;
}
else {
if (put(i)==k && i%5==0)
return i;
else{
if(put(i)>k)
return caut(a,i-1,k);
else
{
if(put(i)==k)
return caut(a,i-1,k);
else
return caut(i+1,b,k);
}
}
}
}
int main()
{
int j;
f>>p;
if(p==0)
c=1;
else
{
c=caut(0,5*p,p);
if(c==-1)
g<<-1<<"\n";
else
g<<c<<"\n";
}
g.close();
f.close();
return 0;
}