Можно полное решение 17 и 19 вопроса? ​

type

  intarr = array[1..10] of integer;

function isprime(n: integer): boolean;

begin

  result : = false;

  if n < 2 then exit;

  var d : = 2;

  while (d < = n div 2) and (n mod d < > 0) do

    d += 1;

  result : = d > n div 2

end;

var

  a, b: intarr;

begin

  print('a: ');

  for var i : = 1 to 10 do

  begin

    a[i] : = i;

    print(a[i])

  end;

  write(newline, 'b: ');

  var j : = 0;

  for var i : = 1 to 10 do

  begin

    if isprime(a[i]) then

    begin

      j += 1;

      b[j] : = a[i];

      print(b[j])

    end

  end

end.

def reverse_order_of_number(x):

    if len(str(x)) == 5:

        test_list = []

        new_test_list = test_list

        for a in str(x):

            test_list.append(a)

        print('before: {}'.format(test_list))

        i = 0

        while i < 2:

            i += 1

            p = test_list.pop()

            new_test_list.insert(0, p)

        print("after: {}".format(new_test_list))

    else:

        print('the number is not five-digit! ')

numbers = int(input("enter a five-digit number: "))

reverse_order_of_number(numbers)

reverse_order_of_number(54321)

reverse_order_of_number(543)