wsxiaoys的次位面空间

Function Get_Hash(q:node):integer;
Var
        t               :       array[0..7]of integer;
        i,j,s           :       Integer;
Begin
        t[0]:=0;
        for i:=1 to 7 do
                Begin
                 t[i]:=0;j:=1;
                 while q.p[j]<>i+1 do inc(j);
                 s:=j+1;
                 for j:=s to 8 do
                  if q.p[j]<i+1 then inc(t[i]);
                End;
        Get_Hash:=0;
        for i:=1 to 7 do
        inc(Get_Hash,t[i]*fact[i]);
End;