tyvj/tyvj1076.pas

   1 var
   2 n,i,j,max:longint;
   3 a:array [1..25,1..25] of longint;
   4
   5 procedure dfs(x,y,sum : longint);
   6 begin
   7    if (x=n) then
   8    begin
   9       if sum mod 100>max then max:=sum mod 100;
  10       exit;
  11    end;
  12    dfs(x+1,y,sum+a[x+1,y] mod 100);
  13    dfs(x+1,y+1,sum+a[x+1,y+1] mod 100);
  14 end; { dfs }
  15
  16 begin
  17    readln(n);
  18    for i:=1 to n do
  19       for j:=1 to i do
  20          read(a[i,j]);
  21    dfs(1,1,a[1,1] mod 100);
  22    writeln(max);
  23 end.