Cod sursa(job #2426767)
Utilizator | Data | 29 mai 2019 11:05:58 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <iostream>
using namespace std;
const int L=28;
int nr_zero(int n)
{
int nr=0;
while(n>=5)
{
nr+=n/5;
n/=5;
}
return nr;
}
int main()
{
long pas=1<<L,r=0,p;
cin>>p;
while(pas!=0)
{
if(nr_zero(r+pas)<p)
{
r+=pas;
}
pas/=2;
}
r++;
if(nr_zero(r)>p)
{
r=-1;
}
cout<<r;
return 0;
}