Triangle de pascal recursive

Program x;
Uses Wincrt;
Type
  mat = Array [0..20,0..20] Of Integer;
Var
  m: mat;
  n: Integer;

Function comb(p,n:Integer): Integer;
Begin
  If (p=0) Or (n=p) Then
    comb := 1
  Else
    comb := comb(p,n-1) + comb(p-1,n-1) ;
End;
Procedure saisir(Var n:Integer);
Begin
  Repeat
    Writeln('Saisir N  = ');
    read(n);
  Until (n>0);
End;
Procedure remplir(n:Integer;Var m:mat);
Var
  i,j: Integer;
Begin
  For i:=0 To n Do
    For j:=0 To i Do
      m[i,j] := comb(j,i);
End;
Procedure affiche(n:Integer;m:mat);
Var
  i,j: Integer;
Begin
  For i:=0 To n Do
    Begin
      For j:=0 To i Do
        Write(m[i,j]:4);
      Writeln;
    End;
End;
Begin
  saisir(n);
  remplir(n,m);
  affiche(n,m);
End.