Const n=9;
var a:array[1..n,1..n] of integer;
i,j:integer;
begin
for i:=1 to n div 2 do
begin
for j:=1 to i-1 do begin a[i,j]:=0; a[i,n-j+1]:=0; end;
for j:=i to n div 2 do begin a[i,j]:=1; a[i,n-j+1]:=1; end;
end;
for i:=n div 2+1 to n do
begin
for j:=1 to n-i do begin a[i,j]:=0; a[i,n-j+1]:=0; end;
for j:=n-i+1 to n div 2 do begin a[i,j]:=1; a[i,n-j+1]:=1; end;
end;
if n mod 2 = 1
then for i:=1 to n do a[i,n div 2 +1]:=1;
for i:=1 to n do
begin
for j:=1 to n do write(a[i,j]:3);
writeln;
end;
end.
Пример:
1 1 1 1 1 1 1 1 1
0 1 1 1 1 1 1 1 0
0 0 1 1 1 1 1 0 0
0 0 0 1 1 1 0 0 0
0 0 0 0 1 0 0 0 0
0 0 0 1 1 1 0 0 0
0 0 1 1 1 1 1 0 0
0 1 1 1 1 1 1 1 0
1 1 1 1 1 1 1 1 1