Автор: Bronislav

Bronislav — Wed, 13 Mar 2019 11:42:25 +0000

program Recur17; //pabc.net

// uses PT4;

function isSign(self: char): boolean; extensionmethod;
begin
  Result := self in ['+', '-', '*']
end;

function Foo(s: string; k, n: integer): integer;
begin
  if k = n then
    Result := s[n].ToDigit
  else
  begin
    var l := n;
    var (Right, Left) := (0, 0);
    while not (s[l].isSign and (Right - Left = 1)) do
    begin
      if s[l] = ')' then Right += 1
      else if s[l] = '(' then Left += 1;
      dec(l)
    end;
    case s[l] of
      '+': Result := Foo(s, k + 1, l - 1) + Foo(s, l + 1, n - 1);
      '-': Result := Foo(s, k + 1, l - 1) - Foo(s, l + 1, n - 1);
      '*': Result := Foo(s, k + 1, l - 1) * Foo(s, l + 1, n - 1);
    end;
  end;
end;

begin
  // Task('Recur17');
  var s := ReadlnString(); // ((4+((5+4)-6)*8)
  Write(Foo(s, 1, s.Length)) // 56
end.

program Recur17; //pabc.net

// uses PT4;

function isSign(self: char): boolean; extensionmethod;

begin

Result := self in ['+', '-', '*']

end;

function Foo(s: string; k, n: integer): integer;

begin

if k = n then

Result := s[n].ToDigit

else

begin

var l := n;

var (Right, Left) := (0, 0);

while not (s[l].isSign and (Right - Left = 1)) do

begin

if s[l] = ')' then Right += 1

else if s[l] = '(' then Left += 1;

dec(l)

end;

case s[l] of

'+': Result := Foo(s, k + 1, l - 1) + Foo(s, l + 1, n - 1);

'-': Result := Foo(s, k + 1, l - 1) - Foo(s, l + 1, n - 1);

'*': Result := Foo(s, k + 1, l - 1) * Foo(s, l + 1, n - 1);

end;

begin

// Task('Recur17');

var s := ReadlnString(); // ((4+((5+4)-6)*8)

Write(Foo(s, 1, s.Length)) // 56

end.

Комментарии: Решаем задачи Абрамян на Паскале. Recur17

Автор: Bronislav