打印数字阵 pascal

var
e,d,n,c,i:integer;
a:array[1..100,1..100] of integer;
begin
readln(n);
i:=0;
for c:=0 to n-1 do
for d:=1 to n do begin
e:=c+d;
if e<=n then begin
inc(i);
a[e,d]:=i;
end;
end;
for c:=1 to n do begin
for d:=1 to n do if a[c,d]<>0 then write(a[c,d],' ');
writeln;
end;
end.

program have_a_try;

var a:array[1..5,1..5]of byte; i,j,k:byte;

begin
k:=0;
for i:=1 to 5 do
for j:=1 to 5-i do
begin
k:=k+1;a[i,j]:=k
end;

for i:=2 to 6 do
begin
for j:=1 to i-1 do
write(a[i-j,j],'');
writeln;
end;
end.

{该方法运用“矩阵线性输出”法得出答案：
以π/4直线输出
1 2 3 4 5
6 7 8 9
10 11 12
13 14
15
}

program baiduask;

var a,b,c,d:integer;
n:=5;
a:=1;b:=1;
w