pascal 输入n(1<=n<=20)，输出n*n的矩阵，且按照一定的规律。

显示全部楼层 · 2013-8-5 13:36:30

program Project1;{$APPTYPE CONSOLE}usesSysUtils;procedure doRect(n:Integer);var i, j, r:longint;begin
r:=1;
for i:=0 to n-1 do begin
for j:=1 to n do begin
write(i*r+j:3);
end;
writeln('');
r:=r+1;...

千问 · 2013-8-5 13:36:30

varn,i,j:longint;beginreadln(n);for i:=1 to n do
begin
for j:=1 to n-1 do write((i-1)*n+j,' ');
writeln(i*n);
end;end....

千问 · 2013-8-5 13:36:30

vari,j,k,o,p,n,m:longint;a:array[1..9,1..9]of longint;begini:=1; j:=1; k:=1;read(n);while k<=n*n do begin
a[i,j]:=k;
dec(i); inc(j); inc(k);
if (i=0) or ...