Pagini recente » Cod sursa (job #691298) | Cod sursa (job #2021414) | Cod sursa (job #323718) | Cod sursa (job #1034184) | Cod sursa (job #20024)
Cod sursa(job #20024)
#include <fstream.h>
unsigned long p,q,n,i,k;
int main()
{
ifstream be("fact.in");
ofstream ki("fact.out");
unsigned long *v = new unsigned long[100];
memset((void*)v, 0, 100*sizeof(unsigned long));
be >> p;
while(q<p)
{
v[0]++; q++; n+=5;
k=0;
while(v[k]==5) {q++; v[k]=0; v[k+1]++; k++;}
}
if (q==p)
{
if (p==0) ki << 1;
else ki << n;
}
else
ki << -1;
//be.close();
//ki.close();
return 0;
}