- 0
- 0
- 约1.68万字
- 约 96页
- 2019-07-01 发布于江苏
- 举报
open:=0; closed:=1; q[1].str:=s1; q[1].depth:=0; while openclosed do begin inc(open); s:=q[open].str; step:=q[open].depth+1; sp:=pos(0,s); for i:=1 to 9 do begin tem:=s; if (i+2=sp)or(i-2=sp) then begin tem[sp]:=s[i]; tem[sp+1]:=s[i+1]; tem[i]:=0; tem[i+1]:=0; if tem=st then print(step); if not find(tem) then begin inc(closed); q[closed
原创力文档

文档评论(0)