Прошу помощи в описании процесса решения задач по паскалю (задачи решены)

program zad1;
var
q,x,y:real;
 
begin
Write('Q = ');Readln(Q);
Write('X = ');Readln(X);
y:=((sqr(x)*sqr(x))*(x+q)+sqr(q)*cos(x+q))/sqrt(abs(x+q));
Writeln('Y = ',y:3:3);
readln;
end.

program zad2;
var
x:integer;
y:real;
 
begin
Write('X = ');Readln(X);
case (X) of
1: y:=x*x*x*x*x+x;
2: y:=1/x;
3: y:=1/x*x;
else y:=sqrt(abs(x*x*x*x*x+x));
end;
Writeln(Y:5:3);
readln;
end.

program zad3;
begin
Writeln('Vvedite massiv B: ');
For i:=1 to 12 do read(B);
readln;
min:=0;
mini:=0;
For i:=1 to 12 do 
begin
if ((B<min) or (min=0)) and (B>0) then
begin
min:=B;
mini:=i;
end;
end;
 
If mini>0 then
begin
Writeln('Min index = ',mini); 
Writeln('Min = ',min); 
end
else Writeln('Net polojitelnyh znacheniy'); 
Writeln('Massiv B = ');
For i:=1 to 12 do Write(B,' '); 
readln;
end.

program zad4;
var
K:array[1..10] of integer;
j,i,k1,c:integer;
 
begin
Writeln('Vvedite massiv K: ');
For i:=1 to 10 do read(K);
readln;
writeln;
write('INPUT: ');
for i:=1 to 10 do write(K,' ');
writeln;
 
For j:=10 downto 1 do 
begin
k1:=1;
For i:=1 to j do if K<K[k1] then k1:=i;
c:=K[j];K[j]:=K[k1];K[k1]:=c;
end;
 
write('OUTPUT: ');
for i:=1 to 10 do write(K,' ');
 
readln;
 
end.

program zad5;
 
var
A:array[1..3,1..3] of integer; 
Amin:array[1..3] of integer;
minJ:integer;
maxI,maxJ:integer;
min,max:integer;
i,j:integer;
 
begin
Writeln('Vvedite matricy A po strokam: ');
for i:=1 to 3 do
begin
for j:=1 to 3 do read(A[i,j]);
readln;
end;
 
maxI:=0;maxJ:=0;
max:=0;
for i:=1 to 3 do 
begin
min:=0;
for j:=1 to 3 do
begin
if (A[i,j]<=min) or (j=1) then 
begin
min:=A[i,j];
[i] Amin:=min;
minJ:=j;
end;
end;
[i] if (Amin>max) or (i=1) then 
begin
[i] max:=Amin;
maxI:=i;
maxJ:=minJ;
end;
end;
 
Write('Minimal = '); 
[i]for i:=1 to 3 do Write(Amin,' ');
writeln;
Write('Max from minimal, A[',maxI,',',maxJ,'] = ',max);
 
writeln;
Writeln('Matrica A: '); 
for i:=1 to 3 do
begin
for j:=1 to 3 do write(A[i,j],' ');
writeln;
end;
readln;
end.

program ctr;
uses crt;
var a,k,i,sum,b:integer;  mas:array[1..20] of integer;
Begin
Clrscr;
Write('Введите A: '); readln(a);
Write('Введите K: '); readln(k);
sum:=0;
 
for i:=1 to 20 do
begin
write('mas[',i,']='); readln(mas[i]);
end;
 
 
for i:=1 to 20 do
begin
if mas[i]  mod 2<>0 then sum:=sum+mas[i];
end;
 
for i:=1 to 20 do
begin
if mas[i] > a then Write('Индексы чисел больше а - ',i);
end;
 
for i:=1 to 20 do
begin
if mas[i]  mod k=0 then Write('Числа кратные ',k,' Есть') else
Write('Чисtk кратны[ ',k,' Нет');
end;
Writeln('Сумма четных чисел = ',sum);
End.

writeln(sqr(b+a));