Cod sursa(job #2345366)
Utilizator | Data | 16 februarie 2019 11:57:21 | |
---|---|---|---|
Problema | Factorial | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int n,i,j,p,k,smax,med,st,dr;
int nr(int r)
{
int nr=0,t=5;
while(r/t)
{
nr+=r/t;
t*=5;
}
return nr;
}
int main()
{
fin>>n;
st=1;
dr=100000000;
while(st<=dr)
{
med=(st+dr)/2;
smax=nr(med);
if(smax==n)
{
k=med;
dr=med-1;
}
else
if(smax>n)
dr=med-1;
else
st=med+1;
}
if(k)
fout<<k;
else
fout<<-1;
return 0;
}