题解：蛇形矩阵（3月23日）

#include <bits/stdc++.h>
using namespace std;
int a[105][105];
int n, m, ans;
int main() {
    cin >> n >> m;
    int n2 = n, m2 = m;
    int x = 1, y = 1, n1 = 1, m1 = 1;
    int k = n * m;
    while (ans < k) {
        for (int i = m1; i <= m && ans < k; i++)
            a[x][y] = ++ans,  y++;
        y--;
        x++;
        n1++;
        for (int i = n1; i <= n && ans < k; i++)
            a[x][y] = ++ans,  x++;
        x--;
        y--;
        m--;
        for (int i = m; i >= m1 && ans < k; i--)
            a[x][y] = ++ans,  y--;
        y++;
        x--;
        n--;
        for (int i = n; i >= n1 && ans < k; i--)
            a[x][y] = ++ans, x-- ;

        x++;
        y++;
        m1++;

    }

    for (int i = 1; i <= n2; i++) {
        for (int j = 1; j <= m2; j++)
            cout << a[i][j] << " ";

        cout << endl;
    }
    return 0;
}