program Laba4;
const Nmax=3;
type ind=1..Nmax;
mas=array [1..Nmax,1..Nmax] of integer;
var a:mas; i,j:ind; S:integer; N:real;
begin
repeat
write ('vviberite sposob vvoda(1-ruchnoi;2-avtomaticheskii)');
readln (N);
until (N=1) or (N=2);
if N=1 then
  begin
   for i:=1 to Nmax do
   for j:=1 to Nmax do
     begin
      write ('a[',i,j,']=');
      readln (a[i,j]);
     end;
  end;
randomize;
if N=2 then
 begin
  for i:=1 to Nmax do
  for j:=1 to Nmax do
   begin
    a[i,j]:=-random (101)+50;
   end;
 end;
write (a[i,j]:4);
writeln;
for i:=1 to Nmax do
for j:=1 to Nmax do
 begin

  if (a[i,j]<0) and (i=j) then
   begin
    for j:=1 to Nmax do
     begin
       S:=S+a[i,j];
     end;
     writeln ('S=',S);
     readln;
   end;
 end;
end.

for i:=1 to Nmax do
 for j:=1 to Nmax do
  begin
   if (a[i,j]<0) and (i=j) then
    begin
     for j:=1 to Nmax do
      begin
       S:=S+a[i,j];
      end;
     writeln ('S=',S);
     readln;
    end;
   end;

for i:=1 to Nmax do
 if a[i,i]<0 then
  begin
   S:=0;
   for j:=1 to Nmax do
    S:=S+a[i,j];
   writeln ('S[',i,']= ',S);
  end;
Readln;

var
 a1,a2,a3,m:WORD;
 b:BOOLEAN;
Begin
 Write('a1= ');
 ReadLn(a1);
 Write('a2= ');
 ReadLn(a2);
 Write('a3= ');
 ReadLn(a3);
 m:=(a1 div 2);
 b:=FALSE;
 Repeat
  b:=((a1 mod m)=0) and
     ((a2 mod m)=0) and
     ((a3 mod m)=0) and
     (m>1);
  DEC(m);
 Until b OR (m=1);
 If b then
  Writeln('The greatest common divisor is ',m)
  else
  Writeln('These numbers have no common divisors');
 ReadLn;
End.