Cod sursa(job #414963)
Utilizator | Catalin Haidau Catah15 | Data | 10 martie 2010 19:24:09 |
---|---|---|---|
Problema | Factorial | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<iostream.h>
#include<fstream.h>
#include<math.h>
ifstream f("fact.in");
ofstream g("fact.out");
int main()
{
long long p,kp,prec,i,S=0,ok=0;
f>>p;
if(p==0)
{
g<<1;
return 0;
}
for(i=1;i<=10;i++)
if(p==pow(5,i))ok=1;
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;
}