Pagini recente » Cod sursa (job #2453106) | Cod sursa (job #2133367) | Cod sursa (job #2590779) | Cod sursa (job #2399183) | Cod sursa (job #471435)
Cod sursa(job #471435)
#include<fstream>
#include<iostream>
using namespace std;
int ff(long long n){
long long p = 5;
int nr = 0;
while (n/p != 0){
nr = nr + n/p;
p = p*5;
}
return nr;
}
int main(){
ifstream f("fact.in");
ofstream g("fact.out");
int p;
f>>p;
if (p == 0)
g<<1;
else {
long long n, st, dr, m;
int x;
st = 1; dr = 6103515625LL;
m = (st + dr)/2;
x = ff(m);
while (st <= dr && x != p){
if (p < x)
dr = m - 1;
else
st = m + 1;
m = (st + dr)/2;
x = ff(m);
}
if (st > dr)
g<<"-1"<<endl;
else g<<(m-m%5);
}
return 0;
}