Cod sursa(job #806399)
| Utilizator | Data | 2 noiembrie 2012 18:46:10 | |
|---|---|---|---|
| Problema | Factorial | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <cstdio>
#include <fstream>
using namespace std;
long long zero(long long n)
{
long long z=0,t;
long long p=5;
while (p<=n)
{
t=n/p;
z=z+t;
p=p*5;
}
return z;
}
int main()
{
freopen("fact.in","r",stdin);
//freopen("fact.out","w",stdout);
ofstream g("fact.out");
long long n;
scanf("%d",&n);
long long ls=1;
long long ld=100000000000,m,p;
while (ls<ld)
{
m=(ls+ld)/2;
if (zero(m)<p) ls=m;
else ld=m;
}
if (zero(ls)==p)
{
g<<ls;
}
else printf("%d",-1);
return 0;
}
