Cod sursa(job #1539383)
Utilizator | Data | 30 noiembrie 2015 18:48:29 | |
---|---|---|---|
Problema | Factorial | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long n,a,n1,i,s;
int v[15];
int main()
{
f>>n;
v[1]=1;
for(i=2;i<=13;++i)
v[i]=v[i-1]*5+1;
if(n==0)
g<<1<<'\n';
else
{
for(i=13;i>=1;--i)
if(n>=v[i])
{
s=s+n/v[i]*pow(5,i);
n=n%v[i];
}
if(n==0)
g<<s<<'\n';
else
g<<-1<<'\n';
}
return 0;
}