Pagini recente » Cod sursa (job #1872786) | Cod sursa (job #2292285) | Cod sursa (job #166917) | Cod sursa (job #1542629) | Cod sursa (job #1075643)
#include <fstream>
#include <cmath>
#include <algorithm>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int n,z,i,a,j,c,dr,st,p,mid,d;
int main(){
fin>>p;
st=1;
dr=500000000;
while(st<=dr){
mid=(st+dr)/2;
z=0;
c=5;
a=1;
while(a!=0){
a=mid/c;
c=c*5;
z=z+a;
}
if(z>=p){
dr=mid-1;
}
else{
st=mid+1;
}
}
c=5;
a=1;
while(a!=0){
a=st/c;
c=c*5;
d=d+a;
}
if(d!=p){
fout<<-1<<"\n";
}
else{
if(p==0){
fout<<1<<"\n";
}
else{
fout<<st<<"\n";
}
}
return 0;
}