Program Intersection_Tab;
Type vect = Array [1..99] of Integer;
Var T1, T2, inter : vect;
n, m : Integer;
(****************************************)
Procedure saisie_int (Var nf : Integer);
Begin
Repeat
Write ('N = ');
Readln (nf);
Until nf in [3..99];
End;
(****************************************)
Procedure remplir_tab (nf : Integer ; Var A:vect);
Var i, j : Integer;
Begin
Writeln ('Saisir la case 1');
Readln (a[1]);
For i:=2 To nf Do
Repeat
Writeln ('Saisir la case ', i);
Readln (A[i]);
j:=i-1;
While (j>1) and (A[i] <> A[j]) Do j:=j-1;
Until A[i]<>A[j];
End;
(****************************************)
Procedure intersection (nf : Integer ; A1, A2:vect; Var p : Integer ; Var B:vect);
Var i, j : Integer;
Begin
p:=0;
For i:=1 To nf Do
Begin
j:=0;
Repeat
j:=j+1;
Until (j=nf) Or (A1[i]=A2[j]);
If A1[i]=A2[j] Then
Begin
p:=p+1;
B[p]:=A1[i];
End;
End;
End;
(****************************************)
Procedure affiche_tab (nf : Integer ; A:vect);
Var i : Integer;
Begin
For i:=1 To nf Do Write (A[i], ' ');
End;
(****************** P.P. *********************)
Begin
saisie_int (n);
remplir_tab (n, T1);
remplir_tab( n, T2);
intersection (n, T1, T2, m, inter);
affiche_tab (n, T1);
Writeln ;
affiche_tab (n, T2);
Writeln ;
affiche_tab (m, inter);
End.