ac1008.pas

同济大学 Online在线题库 AC源代码合集 程序设计竞赛必看资料

program tju1008;
const
  maxn=34;
var
  a:array[1..maxn,0..maxn]of longint;
  n,c,i,j:byte;
begin
  a[1,1]:=1;
  for i:=2 to maxn do
    for j:=1 to i do
      a[i,j]:=a[i-1,j-1]+a[i-1,j];
  repeat
    read(n);inc(c);
    if c>1 then writeln;
    writeln('Case ',c,':');
    for i:=1 to n do begin
      for j:=1 to i-1 do
        write(a[i,j],' ');
      writeln(a[i,i]);
    end;
  until seekeof;
end.