发布时间 : 星期五 文章noip初赛复习（全）new更新完毕开始阅读4b90c92f2af90242a895e5a4
for a:=0 to 1 do for b:=0 to 2*L do for c:=0 to L do m[a,b,c]:=0; m[0,0,0]:=1; for k:=0 to 2*L-1 do begin
for s:=1 to L do begin
m[0,k+1,s] := m[0,k,s+1] + m[1,k,s+1]; m[1,k+1,s]:= (1) ; end;
m[0,k+1,0] :=m[0,k,1]+m[1,k,1]; end; end;
procedure draw(k,s,nth:integer); begin
if (k=0) then exit;
if ((nth-m[1,k,s])>=0) then begin
nth:=nth-m[1,k,s];
if (y>h) then (2) ;
pic[y,x]:=UP; y:=y+1; x:=x+1; draw( (3) ); end
else begin
y:=y - 1; pic[y,x]:=DN; x:=x+1; draw(k-1,s-1,nth); end; end; begin init; read(nth);
for e:=0 to SZ-1 do for f:=0 to SZ-1 do pic[e,f]:= ' '; x:=0; y:=0 h:=0; i:=0;
while ((nth-m[0,2*i,0])>=0) do begin
nth:= nth-m[0,2*i,0]; (4) ; end;
draw( (5) ); for i:=h downto x-1 do begin