Автор: asdfg

asdfg — Sun, 17 Oct 2021 22:02:12 +0000

Код на странице неправильно посчитал 7-3+8+5-7+0*9 набор… Что-то там не работает.
Вот мой вариант:

var
  s: string;
  c: char;

function Cif(c: char): integer;
begin
  case c of 
    '1': Cif := 1;
    '2': Cif := 2;
    '3': Cif := 3;
    '4': Cif := 4;
    '5': Cif := 5;
    '6': Cif := 6;
    '7': Cif := 7;
    '8': Cif := 8;
    '9': Cif := 9;
    '0': Cif := 0;
  end
end;

function Cal(s: string): integer;
var
  st: string;
  x: integer;
begin
  st := s;
  Delete(st, length(s) - 1, 2);
  if length(s) = 1 then 
    Cal := Cif(s[1])
  else 
  if s[length(s) - 1] = '-' then 
  begin
    Cal := Cal(st) - Cif(s[length(s)]);
    
  end
  else if s[length(s) - 1] = '+' then
  begin
    Cal := Cif(s[length(s)]) + Cal(st);
  end
  else
   begin
    if length(s) = 3 then 
    begin
      Cal := Cif(s[1]) * Cif(s[3]);
    end
    else
     begin
      x := Cif(s[length(s) - 2]) * Cif(s[length(s)]);
      if(s[length(s) - 3]) = '-' then
      begin
        Delete(st, length(s) - 3, 2);
        Cal := Cal(st) - x;
      end
      else if (s[length(s) - 3]) = '+' then
      begin
        Delete(st, length(s) - 3, 2);
        Cal := Cal(st) + x;
      end
      else
        begin
        Delete(st, length(s) - 3, 2);
        Cal := Cal(st) * x;
      end;
    end;
  end;
end;



begin
  readln(s);
  writeln(Cal(s));
end.

var

s: string;

c: char;

function Cif(c: char): integer;

begin

case c of

'1': Cif := 1;

'2': Cif := 2;

'3': Cif := 3;

'4': Cif := 4;

'5': Cif := 5;

'6': Cif := 6;

'7': Cif := 7;

'8': Cif := 8;

'9': Cif := 9;

'0': Cif := 0;

end

end;

function Cal(s: string): integer;

var

st: string;

x: integer;

begin

st := s;

Delete(st, length(s) - 1, 2);

if length(s) = 1 then

Cal := Cif(s[1])

else

if s[length(s) - 1] = '-' then

begin

Cal := Cal(st) - Cif(s[length(s)]);

end

else if s[length(s) - 1] = '+' then

begin

Cal := Cif(s[length(s)]) + Cal(st);

end

else

begin

if length(s) = 3 then

begin

Cal := Cif(s[1]) * Cif(s[3]);

end

else

begin

x := Cif(s[length(s) - 2]) * Cif(s[length(s)]);

if(s[length(s) - 3]) = '-' then

begin

Delete(st, length(s) - 3, 2);

Cal := Cal(st) - x;

end

else if (s[length(s) - 3]) = '+' then

begin

Delete(st, length(s) - 3, 2);

Cal := Cal(st) + x;

end

else

begin

Delete(st, length(s) - 3, 2);

Cal := Cal(st) * x;

end;

begin

readln(s);

writeln(Cal(s));

end.

Автор: Bronislav

Bronislav — Mon, 11 Mar 2019 17:10:00 +0000

program Recur15; //pabc.net

// uses PT4;

function Term(s: string; k, n: integer): integer;
begin
  if k = n then
    Result := s[k].ToDigit
  else
    Result := Term(s, k, n - 2) * s[n].ToDigit
end;

function F(s: string; k, n: integer): integer;
begin
  var l := n;
  while (l > 0) and (s[l] <> '+') and (s[l] <> '-') do l -= 1;
  if l > 0 then
  begin
    if s[l] = '+' then
      Result := F(s, k, l - 1) + Term(s, l + 1, n)
    else
    if s[l] = '-' then
      Result := F(s, k, l - 1) - Term(s, l + 1, n);
  end
  else Result := Term(s, k, n)
end;

begin
  // Task('Recur15');
  var s := ReadlnString(); // '1+2*3+4-5+5*6+7+8*9';
  Write(F(s, 1, s.Length)) // 115
end.

program Recur15; //pabc.net

// uses PT4;

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

begin

if k = n then

Result := s[k].ToDigit

else

Result := Term(s, k, n - 2) * s[n].ToDigit

end;

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

begin

var l := n;

while (l > 0) and (s[l] <> '+') and (s[l] <> '-') do l -= 1;

if l > 0 then

begin

if s[l] = '+' then

Result := F(s, k, l - 1) + Term(s, l + 1, n)

else

if s[l] = '-' then

Result := F(s, k, l - 1) - Term(s, l + 1, n);

end

else Result := Term(s, k, n)

end;

begin

// Task('Recur15');

var s := ReadlnString(); // '1+2*3+4-5+5*6+7+8*9';

Write(F(s, 1, s.Length)) // 115

end.

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

Автор: asdfg

Автор: Bronislav