题解 | 蛇形矩阵

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<vector<int> > matrix(n, vector<int>(n, 0));
    int k = (n + 1) * n / 2;
    int x = 0, y = 0;
    for(int i = 1; i <= k; ++i) {
        if(x >= 0 && y >= 0 && x < n && y < n) {
            matrix[x][y] = i;
        }
        if(x == 0) {
            x = y + 1;
            y = 0;
        } else {
            --x; ++y;
        }
    }

    
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < n - i; ++j) {
            cout << matrix[i][j];
            if(j == n - i - 1) cout << endl;
            else cout << " ";
        }
    }
    return 0;
}