Cod sursa(job #2589561)
| Utilizator | Data | 26 martie 2020 16:14:53 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int nr0(long long x)
{
int s=0;
for(int i=5;i<=x;i=i*5)
s+=x/i;
return s;
}
int p,mij,lo,hi;
const int oo=10000000001;
int main()
{
f>>p;
lo=1;
hi=oo;
while(lo<hi)
{
mij=lo+(hi-lo)/2;
if(nr0(mij)<p)
lo=mij+1;
else
hi=mij;
}
if(nr0(lo)==p)
g<<lo;
else g<<-1;
return 0;
}
