1 solutions

  • 0
    @ 2025-11-5 15:24:06

    Pascal :

    var
       n,i,j:longint;
       a,p:array[0..200,0..200]of longint;
    begin
     readln(n);
     for i:=1 to n do
      for j:=1 to i do read(a[i,j]);
     for i:=1 to n do p[n,i]:=a[n,i];
     for i:=n-1 downto 1 do
      for j:=1 to i do
       if p[i+1,j]>p[i+1,j+1]
        then p[i,j]:=p[i+1,j]+a[i,j]else p[i,j]:=a[i,j]+p[i+1,j+1];
     writeln(p[1,1]);
    end.
    
    • 1

    Information

    ID
    16747
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By