ac1091.pas

来自「这是在网络上搜集到的在东京大学的ACM上面解决的一些题目的源码」· PAS 代码 · 共 31 行

program tju1091;
const
  maxk=50;
  maxdigit=87;
var
  a:array[1..maxk,-1..maxdigit]of word;
  k,i:byte;
begin
  a[1,-1]:=1;a[1,0]:=6;a[1,1]:=3;
  for k:=2 to maxk do begin
    a[k,-1]:=a[k-1,-1];
    for i:=0 to a[k,-1] do begin
      inc(a[k,i],a[k-1,i]*55);
      a[k,i+1]:=a[k,i] div 10;
      a[k,i]:=a[k,i] mod 10;
    end;
    while a[k,a[k,-1]+1]>0 do begin
      inc(a[k,-1]);
      a[k,a[k,-1]+1]:=a[k,a[k,-1]] div 10;
      a[k,a[k,-1]]:=a[k,a[k,-1]] mod 10;
    end;
  end;

  repeat
    read(k);
    for i:=a[k,-1] downto 0 do
      write(a[k,i]);
    writeln;
  until seekeof;
end.