Union of set with array of elements, Pascal

Language: Layout:

program UnijaSkupova;

const 
max=50;
type
niz=array[1..max] of integer;
var
n,m,i,j,k:integer;
a,b,c:niz;

begin
writeln('Koliko elemenata ima prvi skup: ');
read(n);
writeln('Unesite rastuci niz elemenata skupa');
i:=1;
while(i<=n) do
begin
read(k);
if(i=1) then begin a[i]:=k; i:=2 end
else if(k=a[i-1]) then writeln('Greska prilikom unosa')
else begin a[i]:=k; i:=i+1 end
end;

writeln('Koliko elemenata ima drugi skup: ');
read(m);
writeln('Unesite rastuci niz elemenata skupa');
i:=1;
while(i<=m) do
begin
read(k);
if(i=1) then begin b[i]:=k; i:=2 end
else if(k=b[i-1]) then writeln('Greska prilikom unosa')
else begin b[i]:=k; i:=i+1 end
end;

k:=1;i:=1;j:=1;
while(i<=n) and (j<=m) do begin
if (a[i]=b[j]) then begin c[k]:=b[j]; j:=j+1; i:=i+1 end
else if (a[i]<b[j]) then begin c[k]:=a[i]; i:=i+1 end
else if (b[i]<a[j]) then begin c[k]:=b[j]; j:=j+1 end;
k:=k+1;
end;

if (i=n) then 
for i:=j to m do begin
c[k]:=b[i];
k:=k+1
end
else 
for j:=i to n do begin
c[k]:=a[j];
k:=k+1
end;

writeln('Unija skupova je: ');
for i:=1 to k-1 do 
write(c[i],' ');

writeln();
writeln('Unija sadrzi ',i,' elemenata');

j:=0;
for i:=1 to n do 
if not(a[i] mod 2=0) then begin
j:=j+1;
a[j]:=a[i]
end;

writeln('Nakon izbazivanja neparnih elemenata iz prvog niza duzina je: ',j);
if(j>0) then begin
writeln('Prvi niz je: ');
for i:=1 to j do write(a[i],' ');
writeln()
end;

j:=0;
for i:=1 to m do 
if not(b[i] mod 2=0) then begin
j:=j+1;
b[j]:=b[i]
end;

writeln('Nakon izbazivanja neparnih elemenata iz drugog niza duzina je: ',j);
if(j>0) then begin
writeln('Drugi niz je: ');
for i:=1 to j do write(b[i],' ');
writeln()
end

end.

Show compiler warnings [ - ] Show input
Compilation time: 0.22 sec, absolute running time: 0.1 sec, cpu time: 0.01 sec, memory peak: 3 Mb, absolute service time: 0,41 sec