преобразовать с Паскаля задачу на питон program Matrix36;
var
a:array [1..10,1..10] of integer;
Num, M, N, i, j:Integer;
Line1,LineM : set of byte;

begin
Write('N: ');
Readln(N);
Write('M: ');
Readln(M);

for i:=1 to M do
begin
writeln(i,': ');
for j:=1 to N do
begin
Write(j,' : ');
Read(a[i,j]);
end;
end;

Line1:=[];
for j:=1 to N do Line1:=Line1+[a[1,j]];

Num:=0;
for i:=2 to M do
begin
LineM:=[];

for j:=1 to N do LineM:=LineM+[a[i,j]];

if Line1=LineM then inc(Num);
end;
Writeln(Num);
end.

Ionа1    1   25.11.2021 08:49    2