Решение задачи Matrix 11

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int m, n;
    cin >> m >> n;
    int a[m][n];
    for(int i = 0; i < m; ++i){
        for(int j = 0; j < n; ++j)
            cin >> a[i][j];
    }
    for(int i = 0; i < m; ++i){
        if(i % 2 == 0)
            for(int j = 0; j < n; ++j)
                cout << a[i][j] << " ";
        else
            for(int j = n - 1; j >= 0; --j)
                cout << a[i][j] << " ";
        cout << endl;
    }
    return 0;
}

import random
import numpy

M = random.randrange(2,10)
N = random.randrange(2,10)
print("M = ",M,"; N = ",N)
a = numpy.zeros((M, N))

k = 0
for i in range(M):
    for j in range(N):
        k += 1
        a[i][j] = k
print(a)

for i in range(M):
    if i%2 == 0:
        print(a[i])
    else:
        print(a[i][::-1])

b = []
for i in range(M):
    b.append([])
    for j in range(N):
        b[i].append(a[i][j])
print(b)

for i in range(M):
    if i%2 == 0:
        print(b[i])
    else:
        print(b[i][::-1])
									

program Matrix11;
var
  a:array [1..10,1..10] of integer;
  M, N, i, j:Integer;
 
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;
 
 for i:=1 to M do
  begin
   for j:=1 to N do
    if i mod 2 <> 0 then Write(' : ',a[i,j])
    else Write(' : ',a[i,N-j+1]);
   writeln(' : ');
  end;
end.