Cod sursa(job #2235844)
Utilizator | Brasoveanu Mircea denmircea | Data | 27 august 2018 01:07:44 |
---|---|---|---|
Problema | Factorial | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("fact.in");
ofstream fout ("fact.out");
unsigned long long a[14],b[14],c[14],i,x,suma;
int main()
{
a[1]=1;
b[1]=1;
for(i=2;i<=13;i++)
{
a[i]=a[i-1]*5;
b[i]=b[i-1]*5+1;
}
fin>>x;
if(x==0)
{
fout<<1;
return 0;
}
for(i=1;b[i]<=x;i++);
i--;
while(x!=0)
{
if(b[i]>x)
i--;
if(b[i]<=x)
{
suma += a[i]*5;
x -= b[i];
c[i]++;
if(c[i]==5)
{
fout<<-1;
return 0;
}
}
}
fout<<suma;
}