Cod sursa(job #1765521)
| Utilizator | Data | 26 septembrie 2016 20:06:42 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int zeros(int n)
{
int v=0, c=5;
while(c<=n)
{
v=v+n/c;
c=c*5;
}
return v;
}
int main()
{
int p, st=1, dr=400000015, m, n;
f>>p;
while(st<=dr)
{
m=(st+dr)/2;
if(zeros(m)>=p)
{
dr=m-1;
n=m;
}
else
st=m+1;
}
if(zeros(n)==p)
g<<n;
else
g<<"-1";
return 0;
}
