Cod sursa(job #514747)
| Utilizator | Data | 19 decembrie 2010 15:16:08 | |
|---|---|---|---|
| Problema | Factorial | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<fstream.h>
#include<math.h>
ifstream f("fact.in");
ofstream g("fact.out");
int main()
{
long long p,kp,prec,i,ok=0;
double S=0;
f>>p;
if(p==0)
{
g<<1;
return 0;
}
if(p<0)
{
g<<-1;
return 0;
}
for(i=1;i<=12;i++)
if(p==pow(5,i))
{
ok=1;
break;
}
if(ok==1)
{
g<<-1;
return 0;
}
while(p!=0)
{
prec=1;kp=1;i=1;
while(kp<=p)
{
kp=prec*5+1;
prec=kp;
i++;
}
S=S+pow(5,i-1);
p=p-(kp-1)/5;
}
g<<S;
f.close();
g.close();
return 0;
}
