Cod sursa(job #2151156)
| Utilizator | Data | 4 martie 2018 10:17:06 | |
|---|---|---|---|
| Problema | Factorial | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin ("fact.in");
ofstream fout ("fact.out");
long long nrzerouri(long long n)
{
long long pow=1,nrzero=0;
while (pow<=n)
{
pow*=5;
nrzero+=n/pow;
}
return nrzero;
}
int n,p,s=1,d=500000000;
int main()
{
fin >>p;
while (s<=d)
{
if (nrzerouri((s+d)/2)>=p)
{
d=(s+d)/2-1;
}
else
{
s=(s+d)/2+1;
}
}
fout << s;
return 0;
}
