Pagini recente » Cod sursa (job #1664863) | Cod sursa (job #488332) | Cod sursa (job #1074559) | Cod sursa (job #676238) | Cod sursa (job #899640)
Cod sursa(job #899640)
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long p, x, i, st, dr;
long long v[12]={0, 5, 25, 125, 625, 3125, 15625, 78125, 390625, 1953125, 9765625, 48828125};
int putere(long long x){
long long s=0;
for(i=1; i<12; i++)
s+=x/v[i];
return s;
}
int main(){
f>>p;
f.close();
if(p==0)
{
g<<"1\n";
g.close();
return 0;
}
st=1;
dr=5*p;
while(st<=dr)
{
// g<<st<<' '<<dr<<" ";
x=(st+dr)/2;
if (putere(x)>=p)
dr=x-1;
else
st=x+1;
// g<<st<<' '<<dr<<"\n";
}
if (putere(st)==p)
g<<st<<"\n";
else
g<<"-1\n";
g.close();
return 0;
}