program yanghui;var b,n:integer; xie:array[1..100]of integer;procedure zuo(b,n:integer);var i:integer;begin inc(b); for i:=1 to n-b do write(' '); {打印空格} for i:=b downto 1 do {打印数字,如果不倒着循环会出现覆盖现象} begin xie[i]:=xie[i-1]+xie[i]; write(xie[i]:6); end; writeln;writeln; if b

顶!

sofa