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

#include <bits/stdc++.h>

using namespace std;

int main()
{

//    1 2 3 4 5
//    5 6 7 8 6
//    9 1 2 3 7
//    4 5 6 7 8
//    9 8 7 6 1

    int m;
    cin >> m;
    vector< vector<int> > a(m, vector<int> (m));
    for(int i = 0; i < m/2; ++i){
        for(int j = i; j < m - i; ++j)
            cin >> a[i][j];
//
//        for(auto i: a){
//            for(auto j: i)
//                cout << j << ' ';
//            cout << endl;
//        }
//        cout << endl;

        for(int j = 1 + i; j < m - i; ++j)
            cin >> a[j][m - i - 1];

//        for(auto i: a){
//            for(auto j: i)
//                cout << j << ' ';
//            cout << endl;
//        }
//        cout << endl;
        for(int j = m - i - 2; j >= i; --j)
            cin >> a[m - i - 1][j];

//        for(auto i: a){
//            for(auto j: i)
//                cout << j << ' ';
//            cout << endl;
//        }
//        cout << endl;
        for(int j = m - 2 - i; j >= i + 1; --j)
            cin >> a[j][i];

//        for(auto i: a){
//            for(auto j: i)
//                cout << j << ' ';
//            cout << endl;
//        }
//        cout << endl;

    }
    cin >> a[m/2][m/2];
    for(auto i: a){
        for(auto j: i)
            cout << j << ' ';
        cout << endl;
    }
    return 0;
}

import random
import numpy

#M = random.randrange(2,10)
M = 5
print("M = ",M)
a = numpy.zeros((M, M))
#a.astype(int)

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

    for j in range(i+1,M-i):
        k += 1
        a[j][M-1-i] = k

    for j in range(M-2-i,i-1,-1):
        k += 1
        a[M-1-i][j] = k

    for j in range(M-2-i,i,-1):
        k += 1
        a[j][i] = k

    i +=2

print(a)


k = 0
for i in range(0,M):
    for j in range(i,M-i):
        print(a[i][j], end=" ")

    for j in range(i+1,M-i):
        print(a[j][M-1-i], end=" ")

    for j in range(M-2-i,i-1,-1):
        print(a[M-1-i][j], end=" ")

    for j in range(M-2-i,i,-1):
        print(a[j][i], end=" ")

    i +=2
									

program Matrix15;
var
  a:array [1..10,1..10] of integer;
  M, i, j, i2:Integer;
 
begin
 
 Write('M: ');
 Readln(M);
 
 for  i:=1 to M do
  begin
   writeln(i,': ');
   for j:=1 to M do
    begin
     Write(j,' : ');
     Read(a[i,j]);
    end;
  end;
 
  for i2:=1 to M div 2 do
   begin
    For i:=i2 to M-i2+1 do Write(a[i2,i],' ');
    For j:=i2+1 to M-i2+1 do Write(a[j,M-i2+1],' ');
    For i:=M-i2 downto i2 do Write(a[M-i2+1,i],' ');
    For j:=M-i2 downto i2+1 do Write(a[j,i2],' ');
    writeln('');
   end;
  writeln(a[M div 2+1,M div 2+1]);
end.
									

#include <bits/stdc++.h>

using namespace std;

int main()
{
    system("chcp 1251");
    srand(time(0));
    int m;
    cin >> m;
    vector <vector < int > > ar(m , vector < int > (m));
    for (unsigned i = 0;i < ar.size();++i)
        for (unsigned j = 0;j < ar.size();++j)
            ar[i][j] = rand() % 90 + 10;
    for (auto i : ar){
        for (auto j : i)
            cout << j << " ";
        cout << endl;
    }
    cout << endl;//size_t = unsigned
    for (size_t i = 0;i < ar.size() / 2 + 1;++i){
        for (size_t j = i;j < ar.size() - i;++j)
            cout << ar[i][j] << " ";
    for (size_t j = i + 1;j < ar.size() - i;++j)
        cout << ar[j][ar.size() - i - 1] << " ";
    for (size_t j = ar.size() - 2 - i;(int)j > i;--j)
        cout << ar[ar.size() - i - 1][j] << " ";
    for (size_t j = ar.size() - 1 - i;j > i;--j)
        cout << ar[j][i] << " ";
    }
    return 0;
}

// Решение пользователя Electro Full