Pagini recente » Cod sursa (job #2692135) | Cod sursa (job #3002576) | Cod sursa (job #230379) | Cod sursa (job #2405214) | Cod sursa (job #2182427)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int n;
int nr0(int x){
int nr=0;
while(x>0){
x/=5;
nr+=x;
}
return nr;
}
int bin_search(int l,int r){
if(l==r) if(nr0(l)==n)return l;
else return -1;
int m=(l-r)/2+r;
int n0=nr0(m);
if(n0==n)return m;
else if(n0<n) return bin_search(m+1,r);
else return bin_search(l,m-1);
}
int main(){
f>>n;
if(n==0)g<<'1';
else{
int x=bin_search(1,400000015);
x=x/5*5;
if(x==0)x=-1;
g<<x;
}
}