Pagini recente » Cod sursa (job #1759489) | Cod sursa (job #213124) | Cod sursa (job #86420) | Cod sursa (job #980165) | Cod sursa (job #2454324)
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int five( long long n){
int nr = 0;
while ( n/5){
nr += n/5;
n /= 5;
}
return nr;
}
int binarysearch(int n, int p){
int lo, hi, mid;
lo = 0;
hi = n+1;
while ( hi - lo > 1){
mid =( lo + hi ) /2;
if ( five(mid) < p )
lo = mid;
else
hi = mid;
}
return hi;
}
int main(){
int p, nr = 1, i;
f >> p;
if ( p == 0 ){
g << 1;
return 0;
}
p = binarysearch(5*p, p);
g << p;
}