MBEEWALK - Bee Walk

Tác giả: flashmt

Ngôn ngữ: Pascal

const dx:array[1..6] of longint=(-1,-1,0,0,1,1);
      dy:array[1..6] of longint=(0,1,-1,1,-1,0);
var f:array[-14..14,-14..14,0..14] of longint;
    n,test,it:longint;

procedure init;
var i,x,y,j:longint;
begin
     f[0,0,0]:=1;
     for i:=1 to 14 do
       for x:=-14 to 14 do
         for y:=-14 to 14 do
           if f[x,y,i-1]>0 then
              for j:=1 to 6 do
                  inc(f[x+dx[j],y+dy[j],i],f[x,y,i-1]);
end;

begin
     init;
     read(test);
     for it:=1 to test do
     begin
          read(n);
          writeln(f[0,0,n]);
     end;
end.

Download