Pagini recente » Cod sursa (job #1580834) | Cod sursa (job #763128) | Cod sursa (job #141115) | Cod sursa (job #990859) | Cod sursa (job #732217)
Cod sursa(job #732217)
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int zero (int n)
{
int i=1, Nr=0;
while(pow(5,i)<=n)
{
Nr=Nr+n/int(pow(5,i));
i++;
}
return Nr;
}
int Cautare(int st, int dr, int p)
{
int mij=(st+dr)/2;
if (st==dr) return st;
if (zero(mij)==p) return mij;
else if(zero(mij)>p)
return Cautare(st, mij, p);
else
return Cautare(mij+1,dr,p);
}
int main()
{
int P;
f>>P;
if (P==zero(Cautare(4*P,5*P,P))) g<<Cautare(4*P,5*P,P);
else g<<-1;
f.close();
g.close();
}