Cod sursa(job #2470690)
| Utilizator | Data | 9 octombrie 2019 17:55:59 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int nr_5(int n)
{
int p5 = 5 , s=0;
while(n >= p5)
{
s+=n/p5;
p5*=5;
}
return s;
}
int main()
{
int li = 1 , lf = INT_MAX , p ;
f >> p ;
while(li<=lf)
{
int mij = (li+lf)/2;
int nr_0=nr_5(mij);
if(nr_0>=p)
lf=mij-1;
else
li=mij+1;
}
if(nr_5(li)==p)
g << li ;
else
g << -1;
return 0;
}
