迷宫问题

来源：互联网发布：淘宝死店还能活吗编辑：程序博客网时间：2024/05/21 06:47
const  maxn=8;  dx:array[0..maxn] of integer=(0,-1,-1,-1,0,1,1,1,0);  dy:array[0..maxn] of integer=(0,-1,0,1,1,1,0,-1,-1);var  n,s,total:integer;  a:array[0..maxn+1,0..maxn+1] of 0..1;  b:array[0..maxn*maxn] of integer;procedure init;  var    i,j:integer;begin  readln(n);  for i:=1 to n do    begin      for j:=1 to n do        read(a[i,j]);      readln;    end;  s:=0;total:=0;a[1,1]:=1;end;procedure print;  var    i,x,y:integer;  begin    inc(total);     x:=1;y:=1;    for i:=1 to s-1 do      begin        x:=x+dx[b[i]];        y:=y+dy[b[i]];      end;    x:=x+dx[b[s]];y:=y+dy[b[s]];  end;procedure search(x,y:integer);  var    i,sx,sy:integer;  begin    if (x=1) and (y=n)      then begin              print;              exit;            end;    for i:=1 to maxn do      if (x+dx[i] in [1..n]) and (y+dy[i] in [1..n]) and (a[x+dx[i],y+dy[i]]=0)        then begin               inc(s);               b[s]:=i;               a[x+dx[i],y+dy[i]]:=1;               search(x+dx[i],y+dy[i]);               dec(s);               a[x+dx[i],y+dy[i]]:=0;             end;  end;begin  init;  search(1,1);  writeln(total);end.
0 0