Cod sursa(job #2065236)
Utilizator | Rosu Diana Michesa dianamichesa | Data | 13 noiembrie 2017 16:58:23 |
---|---|---|---|
Problema | Factorial | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
const int N=30001,L=30;
int p;
int zero(int p)
{
int nrz=0;
while(p>=5){
nrz+=p/5;
p/=5;
}
return nrz;
}
int f2(int p)
{
int pas=1<<L;
int r=0;
while(pas!=0){
if(zero(r+pas)<p)
r+=pas;
pas/=2;
}
return r+1;
}
int main()
{
f>>p;
int k=f2(p);
if(zero(k)==p)
g<<k;
else
g<<-1;
return 0;
}