Cod sursa(job #2241076)
| Utilizator | Data | 14 septembrie 2018 18:45:31 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long zerocount (long long x)
{
long long c=0,i=5;
while (x/i>0)
{
c+=x/i;
i*=5;
}
return c;
}
int main()
{
long long p;
f>>p;
if (p==0) g<<"1";
else
{
long long st=5,dr=5*p;
while (st<dr)
{
long long m=(st+dr)/2;
if (zerocount(m)<p) st=m+1;
else dr=m;
}
if (zerocount(st)==p) g<<st;
else g<<"-1";
}
f.close();
g.close();
return 0;
}
