Pagini recente » Cod sursa (job #434604) | Cod sursa (job #484191) | Cod sursa (job #498882) | Cod sursa (job #1851461) | Cod sursa (job #2503217)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
/*
int main()
{
int n;
fin >> n;
if(n%6==5)
{
fout<<-1;
return 0;
}
if(n==0)
{
fout<<1;
return 0;
}
fout<<(n-n/6)*5;
return 0;
}
int main()
{
long long n, p=0, i=0, x;
fin >> n;
if(n==0)
{
fout<<1;
return 0;
}
while (i<n)
{
p+=5;
x=p;
while (x%5==0)
{
x/=5;
i++;
}
}
if(i>n)
fout<<-1;
else
fout<<p;
return 0;
}
*/
int main()
{
long long n, v[11]={0}, i=0;
fin >> n;
while(i<n)
{
if(v[1]<4)
{
i++;
v[1]++;
}
else
{
v[1]=0;
if(v[2]<4)
{
i+=2;
v[2]++;
}
else
{
v[2]=0;
if(v[3]<4)
{
i+=3;
v[3]++;
}
else
{
v[3]=0;
if(v[4]<4)
{
i+=4;
v[4]++;
}
else
{
v[4]=0;
if(v[5]<4)
{
i+=5;
v[5]++;
}
else
{
v[5]=0;
if(v[6]<4)
{
i+=6;
v[6]++;
}
else
{
v[6]=0;
if(v[7]<4)
{
i+=7;
v[7]++;
}
else
{
v[7]=0;
if(v[8]<4)
{
i+=8;
v[8]++;
}
else
{
v[8]=0;
if(v[9]<4)
{
i+=9;
v[9]++;
}
else
{
v[9]=0;
if(v[10]<4)
{
i+=10;
v[10]++;
}
}
}
}
}
}
}
}
}
}
}
if(i>n)
fout<<-1;
else
{
n=5*(v[1]+5*(v[2]+5*(v[3]+5*(v[4]+5*(v[5]+5*(v[6]+5*(v[7]+5*(v[8]+5*(v[9]+5*(v[10]))))))))));
fout<<n;
}
return 0;
}