Cod sursa(job #2115023)
| Utilizator | Data | 26 ianuarie 2018 10:35:28 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int n;
int nrz(int x)
{
int rez=0,p=5;
while(p<x)
{
rez=rez+x/p;
p*=5;
}
if(!rez)
return 1;
return rez;
}
int bsearch(long long n)
{long long mij=0;
long long st=0;
long long dr=1000000000;
while(st<dr)
{
mij=(st+dr)/2;
if(nrz(mij)>n)
dr=mij;
else
st=mij+1;
}
return st;
}
int main()
{
f >> n;
if(n==0)
g <<"1";
else
if(nrz(bsearch(n)-5)!=n)
g<<-1;
else
g << bsearch(n)-5;
return 0;
}
