Cod sursa(job #2454333)
| Utilizator | Data | 7 septembrie 2019 22:48:31 | |
|---|---|---|---|
| Problema | Factorial | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#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( 700000015, p);
g << p;
}