ac1035.pas

某牛人写的acm.tongji.edu.cn上大部分ac的代码,仅供学习研究,请不要用来作弊

program tju1035;
const
  maxn=10;
  sols=6563;
type
  soltype=record wid:byte;code:longint;end;
var
  map:array[-maxn..maxn,-maxn..maxn]of boolean;
  sol:array[1..sols]of soltype;
  ans:array[1..maxn]of word;
  count,n:word;
function min(a,b:shortint):shortint;
  begin
    if a<b then min:=a else min:=b;
  end;
function max(a,b:shortint):shortint;
  begin
    if a>b then max:=a else max:=b;
  end;
procedure search(l,x1,x2,y1,y2:shortint);
  var
    i,j:shortint;
  function store:boolean;
    var
      w,c,x,i,j:longint;
    begin
      w:=max(x2-x1,y2-y1);c:=maxlongint;
      if x2-x1<=y2-y1 then begin
        x:=0;for i:=x1 to x2 do for j:=y1 to y2 do x:=x*2+ord(map[i,j]);if x<c then c:=x;
        x:=0;for i:=x1 to x2 do for j:=y2 downto y1 do x:=x*2+ord(map[i,j]);if x<c then c:=x;
        x:=0;for i:=x2 downto x1 do for j:=y1 to y2 do x:=x*2+ord(map[i,j]);if x<c then c:=x;
        x:=0;for i:=x2 downto x1 do for j:=y2 downto y1 do x:=x*2+ord(map[i,j]);if x<c then c:=x;
      end;
      if y2-y1<=x2-x1 then begin
        x:=0;for i:=y1 to y2 do for j:=x1 to x2 do x:=x*2+ord(map[j,i]);if x<c then c:=x;
        x:=0;for i:=y1 to y2 do for j:=x2 downto x1 do x:=x*2+ord(map[j,i]);if x<c then c:=x;
        x:=0;for i:=y2 downto y1 do for j:=x1 to x2 do x:=x*2+ord(map[j,i]);if x<c then c:=x;
        x:=0;for i:=y2 downto y1 do for j:=x2 downto x1 do x:=x*2+ord(map[j,i]);if x<c then c:=x;
      end;
      for i:=1 to count do
        if (sol[i].wid=w) and (sol[i].code=c) then begin
          store:=false;exit;
        end;
      store:=true;inc(ans[l]);
      inc(count);with sol[count] do begin wid:=w;code:=c;end;
    end;
  begin
    if not store then exit;
    if l=maxn then exit;
    for i:=x1-1 to x2+1 do
      for j:=y1-1 to y2+1 do
        if not map[i,j] and (map[i-1,j] or map[i+1,j] or map[i,j-1] or map[i,j+1]) then begin
          map[i,j]:=true;
          search(l+1,min(x1,i),max(x2,i),min(y1,j),max(y2,j));
          map[i,j]:=false;
        end;
  end;
begin
  map[0,0]:=true;
  search(1,0,0,0,0);

  repeat
    read(n);
    writeln(ans[n]);
  until seekeof;
end.