program lougras; uses crt; var i,j,n,nsqr:integer; q,qq:boolean; dx,dy:array[1..8]of integer; h:array[1..8,1..8]of integer; procedure lepes(i,x,y:integer;var q:boolean); var k,u,v:integer; q1:boolean; begin k:=0; repeat k:=k+1; q1:=false; u:=x+dx[k];v:=y+dy[k]; if(1<=u)and(u<=n)and(1<=v)and(v<=n)and(h[u,v]=0)then begin h[u,v]:=i; if i