Cod sursa(job #2097123)
Utilizator | Data | 30 decembrie 2017 16:07:53 | |
---|---|---|---|
Problema | Factorial | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f ("fact.in");
ofstream g ("fact.out");
int n;
long long step,i;
int nrzero (int val)
{
int nr=0;
while (val>=5)
{
nr+=val/5;
val=val/5;
}
return nr;
}
int main()
{
f>>n;
step=1<<30;
for (i=0;step;step>>=1)
{
if (nrzero(i+step)<n)
{
i+=step;
}
}
if (nrzero(i+1)==n)
g<<i+1<<'\n';
else g<<-1;
return 0;
}