интересные задачки)

[Chief]

как делать эти задачи? вообще непонимаю их(

[Tkirill]

uses crt;
const
m=5;
n=6;
var
mas:array[1..m,1..n] of real;
i,j,b:integer;
min:real;
begin
clrscr;
randomize;
for i:=1 to m do
begin
for j:=1 to n do
begin
mas[i,j]:=random(10);
write(mas[i,j]:2:1,' ');
end;
writeln;
end;
writeln;
b:=0;
for i:=1 to m do
begin
min:=mas[i,1];
for j:=2 to n do
if mas[i,j]<min then min:=mas[i,j];
b:=b+1;
writeln('B',b,'=',min:2:1);
end;
readln;
end.

[Tkirill]

uses crt;
var
a:array[1..25] of integer;
b:array[1..100] of integer;
n,i,j:integer;
f:boolean;
begin
clrscr;
for i:=1 to 9 do
begin
write(' -> ');
readln(a[i]);
end;
writeln;
writeln;
write('n -> ');
readln(n);
for i:=1 to n do
begin
write(' -> ');
readln(b[i]);
end;
writeln;
writeln;
for i:=1 to n do
begin
f:=true;
for j:=1 to 9 do
begin
if b[i]=a[j] then f:=false;
end;
if f then writeln(b[i]);
end;
readln;
end.

[Tkirill]

uses crt;
type
ar=array[1..100] of integer;
var
mas:ar;
fl:boolean;
n,i:integer;
procedure prost(x:integer; var f:boolean);
var
i:integer;
begin
f:=true;
for i:=2 to ((x div 2)+1) do
if x mod i=0 then f:=false;
if (x=2) or (x=1) then f:=true;
end;
begin
clrscr;
write(' n -> ');
readln(n);
writeln;
writeln(' vvodite chisla ');
writeln;
for i:=1 to n do
begin
write(' -> ');
readln(mas[i]);
end;
writeln;
writeln;
writeln(' Posledovatelnosti prostih chisel ');
writeln;
writeln;
i:=1;
repeat
prost(mas[i],fl);
if fl then
begin
prost(mas[i+1],fl);
if fl then
begin
write(mas[i],' ',mas[i+1],' ');
if i+2<=n then
i:=i+2;
prost(mas[i],fl);
while (fl) and (i<=n) do
begin
write(mas[i],' ');
i:=i+1;
prost(mas[i],fl);
end;
writeln;
writeln;
end;
end
else i:=i+1;
until i>n;
readln;
end.


С тебя отзыв ))