Pagini recente » Diferente pentru preoni-2007/runda-1/solutii intre reviziile 26 si 25 | Istoria paginii utilizator/matei1905 | Monitorul de evaluare | Monitorul de evaluare | Cod sursa (job #20032)
Cod sursa(job #20032)
#include <fstream.h>
int main()
{
ifstream be("fact.in");
ofstream ki("fact.out");
unsigned long v[100];
memset((void*)v, 0, 20*sizeof(unsigned long));
unsigned long p,q=0,n=0,k;
be >> p;
while(q<p)
{
v[0]++; q++; n+=5;
k=0;
while(v[k]==5) {q++; v[k++]=0; v[k]++;}
}
if (q==p)
{
if (p==0) ki << 1;
else ki << n;
}
else
ki << -1;
//be.close();
//ki.close();
return 0;
}