Mistři v programování na #hovnokod

C/C++ #260

//init matrix
 while ((founded==1)&&(mat[nx][ny]<=0)) {
  founded=0;
  iii=y-i;
  while (((i==0)&&(iii==y))||((iii<=y+i))){
   ii=x-i;
   while ((ii<=x+i)){
	if ((mat[ii][iii]==i)&&((ii<70)&&(ii>=0))&&((iii<70)&&(iii>=0))) {
	 bii=ii;
	 biii=iii;
	 if ((mat[bii+1][biii]==-1)&&(bii+1<70)&&(bii+1>=0)) {
	  mat[bii+1][biii]=i+1;
	  founded=1;
	 }
	 if ((mat[bii-1][biii]==-1)&&(bii-1<70)&&(bii-1>=0)) {
	  mat[bii-1][biii]=i+1;
	  founded=1;
	 }
	 if ((mat[bii][biii+1]==-1)&&(biii+1<70)&&(biii+1>=0)) {
	  mat[bii][biii+1]=i+1;
	  founded=1;
	 }
	 if ((mat[bii][biii-1]==-1)&&(biii-1<70)&&(biii-1>=0)) {
	  mat[bii][biii-1]=i+1;
	  founded=1;
	 }
	}
	ii++;
   }
   iii++;
  }
  i++;
 }
 if (mat[nx][ny]>=0) {
  if ((nx==40)&&(ny==57)) {
   nx=nx;
  }
  ik=i;
  ii=nx;
  iii=ny;
  // search path
  while (ik>1) {
   if ((mat[ii-1][iii]==ik-1)&&(ii-1<70)&&(ii-1>=0)) {
	ii--;
	mat[ii][iii]=-3;
   }
   if ((mat[ii][iii-1]==ik-1)&&(iii-1<70)&&(iii-1>=0)) {
	iii--;
	mat[ii][iii]=-3;
   }
   if ((mat[ii+1][iii]==ik-1)&&(ii+1<70)&&(ii+1>=0)) {
	ii++;
	mat[ii][iii]=-3;
   }
   if ((mat[ii][iii+1]==ik-1)&&(iii+1<70)&&(iii+1>=0)) {
	iii++;
	mat[ii][iii]=-3;
   }
   ik--;
  }
   ax=ii*10+5;
   ay=iii*10+5;
  //out_to_file(mat,"d:\\out.txt");
  i++;
   ii=0;
   iii=0;
   while ((iii>-1)&&(iii<70)){
	ii=0;
	while ((ii>-1)&&(ii<70)){
	 if ((mat[ii][iii]>-1)||(mat[ii][iii]==-3)) {
	  mat[ii][iii]=-1;
	 }
	 ii++;
	}
	iii++;
   }
  nx=ax;
  ny=ay;
 } else ...
 }

HovnoKod,