CPP0233 - MA TRẬN XOẮN ỐC - 2

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int m, n;
        cin >> m >> n;
        int M[100][100];
        for (int i = 0; i < m; i++)

            for (int j = 0; j < n; j++)
                cin >> M[i][j];

        int index = 0;
        int a[1000];
        int x = m, y = n;
        for (int i = 0; i <= min(x, y) / 2; i++)
        {
            for (int j = i; j < n; j++)
                a[index++] = M[i][j];
            for (int j = i + 1; j < m; j++)
                a[index++] = M[j][n - 1];
            for (int j = n - 2; j >= i; j--)
                a[index++] = M[m - 1][j];
            for (int j = m - 2; j > i; j--)
                a[index++] = M[j][i];
            m--;
            n--;
        }

        for (int i = x * y - 1; i >= 0; i--)
            cout << a[i] << ' ';
        cout << endl;
    }
}