Cod sursa(job #687381)
| Utilizator | Data | 22 februarie 2012 12:55:24 | |
|---|---|---|---|
| Problema | Factorial | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
#include <math.h>
using namespace std;
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
long N,K,nr,j,m,p,i,OK;
f>>N;
K=0;
i=0;
OK=0;
j=100000000;
if(N==0) g<<1;
else
{
while(i<=j)
{ m=(i+j)/2;
nr=0; p=5;
while(p<m) {nr=nr+m/p; p=p*5;}
if(nr==N) { OK=1; while(m%5!=0) {m--; g<<m;}}
else if(nr>N) j=m-1;
else i=m+1;
}
if(OK==0) g<<-1;
}
f.close();
g.close();
return 0;
}