PASCAL蛇行方阵

是
~1~~2~~6~~7~~15
-3~~5~~8~~14~16
-4~~9~~13~17~22
-10~12~18~21~23
-11~19~20~24~25-吧

var a:array[1..10,1..10]of integer;
c,i,j,d,n,l,k:integer;
b,b2:boolean;
procedure deal;
forward;
procedure zx;
begin
inc(i);
dec(j);
end;
procedure ys;
begin
dec(i);
inc(j);
end;
procedure deal;
begin
for k:=1 to n*2-3 do
begin
if not((i=1)and(j=n))then
if (i=1)or(i=n) then inc(j);
if (j=1)or(j=n) then inc(i);
if (i=1)or(j=n) then b2:=true;
if (j=1)or(i=n) then b2:=false;
if b then inc(d)
else dec(d);
if d=n then b:=false;
if b2 then repeat
inc(c);
a[i,j]:=c;
zx;
until(j=1)or(i=n)
else repeat
inc(c);
a[i,j]:=c;
ys;
until(i=1)or(j=n);
inc(c);
a[i,j]:=c;
end;
end;
begin
assign(input,'snakesquare.in');rese