不是VIP会员,不能显示答案

题目解答

题目:
program excp2
var
i,j:integer;;
a :array[1..14] of integer;

procedure sw(i1,j1:Integer);
var k1: Integer;
begin
for k1:= 1 to(j1- i1+1) div 2 do
begin
a[i1+k1-1]:=a[i1+ k1-1]+a[j1-k1+1];
a[j1-k1+1]:=a[i1+k1-1]-a[j1-k1+1];
a[i1+k1-1]:=a[i1+k1-1]-a[J1-k1+1];
end;
end;
begin
j:=211;
for i:=1 to 14 do
begin
a[i]:=i; J:=j-i
end;
sw(1,4); sw( 5,10);
Sw(11,14);sw(1,14);
For i:=1 to 14 do
begin
If j mod I=1 then write (a[i]:3);
j:=j-a[i];
end;
WRITElN
end.
输出:12 5 10
考点:
分析:
解答:
评论:
老师: