Kód:
program Polia;
var pole1,pole2,prienik:array of integer;
I,J:integer;
procedure zorad(var vstup:array of integer);
begin
for i:=low(vstup) to high(vstup) do begin
for j:=low(vstup) to i do begin
if vstup[j]>vstup[i] then begin
vstup[i]:=vstup[i]+vstup[j];
vstup[j]:=vstup[i]-vstup[j];
vstup[i]:=vstup[i]-vstup[j];
end;
end;
end;
end;
procedure najdiprienik(a,b:array of integer);
var n:integer;
begin
n:=1;
for I:=low(a) to high(a) do begin
for J:=low(b) to high(b) do begin
if a[i]=b[j] then begin
setlength(prienik,n);
prienik[n-1]:=a[i];
inc(n);
end;
end;
end;
end;
begin
writeln('Zadaj velkost pola 1: ');
read(I);
setlength(pole1,I);
writeln('Zadaj velkost pola 2: ');
read(I);
setlength(pole2,I);
for I:=low(pole1) to high(pole1) do begin
write('Zadaj hodnotu do 1. pola: ');
read(pole1[i]);
end;
for I:=low(pole2) to high(pole2) do begin
write('Zadaj hodnotu do 2. pola: ');
read(pole2[i]);
end;
zorad(pole1);
zorad(pole2);
najdiprienik(pole1,pole2);
zorad(prienik);
writeln;
writeln;
write('Pole 1: ');
for I:=low(pole1) to high(pole1) do write(pole1[i],' ');
writeln;
write('Pole 2: ');
for I:=low(pole2) to high(pole2) do write(pole2[i],' ');
writeln;
write('Prienik: ');
for I:=low(prienik) to high(prienik) do write(prienik[i],' ');
writeln;
end.
