Автор: Bronislav

Bronislav — Sun, 19 Aug 2018 15:06:46 +0000

program Array121;//pabc.net

begin
  var k := 1;
  var n := 10;
  var a := Lst(SeqRandom(n, 1, 2)); a.Println;
  
  var i := 0;
  
  while i <= n - 1 do
  begin
    if (i = 0) or (a[i] <> a[i - 1]) then
    begin
      k -= 1;
      if k = 0 then
      begin
        var j := i;
        while (j <= n - 1) and (a[j] = a[i]) do Inc(j);
        a.InsertRange(i, SeqFill(j - i, a[i]));
        n += (j - i);
        break
      end
    end;
    i += 1
  end;
  
  a.Println;
end.

program Array121;//pabc.net

begin

var k := 1;

var n := 10;

var a := Lst(SeqRandom(n, 1, 2)); a.Println;

var i := 0;

while i <= n - 1 do

begin

if (i = 0) or (a[i] <> a[i - 1]) then

begin

k -= 1;

if k = 0 then

begin

var j := i;

while (j <= n - 1) and (a[j] = a[i]) do Inc(j);

a.InsertRange(i, SeqFill(j - i, a[i]));

n += (j - i);

break

end

end;

i += 1

end;

a.Println;

end.

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

Автор: Bronislav