Cod sursa(job #1267348)
Utilizator | Data | 19 noiembrie 2014 20:15:28 | |
---|---|---|---|
Problema | Factorial | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long int p;
ifstream f("fact.in");
ofstream g("fact.out");
int i;
f>>p;
if(p==0){g<<1;return 0;}
long p5[14],nrz[14];
int cap[14];
p5[0]=1;
for(i=1;i<=13;i++)
{p5[i]=p5[i-1]*5;cap[i]=4;}
nrz[1]=1;
for(i=2;i<=13;i++)
nrz[i]=p5[i-1]+nrz[i-1];
i=13;
long n=0;
while(i>0&&p)
{ while(p>=nrz[i]&&cap[i])
{n+=p5[i];cap[i]--;p-=nrz[i];}
i--;
}
if(i==0&&p)n=-1;
g<<n;
}