Cod sursa(job #1216719)
| Utilizator | Data | 5 august 2014 16:02:58 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.76 kb |
#include <fstream>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int n,sol,p,nrz,li,ls,mij;
int nr0(int l)
{
int nr=0,p=5,sol=0,x;
for(;;)
{
x=l/p;
if (x==0) break;
sol+=x;
p*=5;
}
return sol;
}
int main()
{
fin>>n;
if (n==0) fout<<"1";
else {
li=1;ls=n*5;
while(li<=ls)
{
mij=(li+ls)/2;
nrz=nr0(mij);
if(nrz==n) li=ls+1;
if(nrz>n) ls=mij-1;
if(nrz<n) li=mij+1;
}
if (nrz!=n) fout<<"-1";
else {
p=mij;
while (p%5!=0) p--;
fout<<p;
}
}
}
