Cod sursa(job #2470688)
Utilizator | Data | 9 octombrie 2019 17:55:25 | |
---|---|---|---|
Problema | Factorial | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
int nr(int n)
{
int p5=5,s=0;
while(n>=p5)
{
s+=n/p5;
p5*=5;
}
return s;
}
int main()
{
ifstream f("fact.in");
ofstream fout("fact.out");
int li=1,lf=2147483647,n0,m,p;
f>>p;
while(li<=lf)
{
m=(li+lf)/2;
n0=nr(m);
if(n0>=p)
lf=m-1;
else li=m+1;
}
if(nr(li)==p) fout<<li;
else fout<<-1;
return 0;
}