Program Chaines_inverses;
Type Tab=Array [1..100] of String [50];
Var p, q : Tab;
i, n : Integer;
(*********************************)
Procedure
saisie_entier (Var m : Integer);
Begin
Repeat
Writeln ('Donner un entier');
Readln (m);
Until (1<m) and (m<100);
End;
(*************************************)
Procedure saisie_tab (m : Integer; Var T : Tab);
Var i, j : Integer;
test : Boolean;
Begin
For i:=1 To m Do
Repeat
Writeln ('Donner l''élément d''ordre ', i);
Readln (T[i]);
j:=0;
test:=True;
While (test=True) and (j<Length (T[i])) Do
Begin
j:=j+1;
If Not (T [i, j] in ['0'..'9']) Then test:=False;
End;
Until (test=True) and (T[i] <>'');
End;
(***************************************)
Function inverse (ch : String) : String;
Var i : Integer; 
chinv : String;
Begin
chinv:='';
For i:=Length (ch) Downto 1 Do chinv:=chinv+ch[i];
inverse:=chinv;
End;
(***********************************)
Procedure Affiche_tab (m : Integer; T : Tab);
Var i : Integer;
Begin
For i:=1 To m Do 
Write (T[i], ' ');
End;
(***************** P.P *********************)
Begin
saisie_entier (n);
saisie_tab (n, p);
For i:=1 To n Do
q[i] := inverse (p[i]);
affiche_tab (n, q);
End.