/NOEL - Cây thông Noel

<Problem>

http://ntucoder.net/Problem/Details/1171
              Uses Crt;
        Var n:longint; i,j,k,d,d1,d2,d3,t,f,tong,chieu_rong,r:longint;
            s:array[1..1000] of string;
        Begin
            readln(n);
        
            chieu_rong:=-1;
            for i:=1 to n+2 do chieu_rong:=chieu_rong+2;
            r:=chieu_rong;
        
            tong:=n+n+1+n+2;
            t:=tong;
        
            d:=n;
            d1:=n;
            d2:=n+1;
            d3:=n+2;
        
            f:=1;
        
            for i:=1 to d3 do
            begin
             for j:=1 to f do
              if (j=1) or (j=f) then s[i]:=s[i]+'#' else s[i]:=s[i]+'x';
             f:=f+2;
            end;
        
            for i:=0 to 2 do
             begin
                 for j:=1 to d do
                  begin
                      for k:=1 to (r-length(s[j])) div 2 do write('.');
                      write(s[j]);
                      for k:=1 to (r-length(s[j])) div 2 do write('.');
                      writeln;
                  end;
                 d:=d+1;
             end;
            readln;
        End.