题解 | #蛇形矩阵#

#include <stdio.h>

int main() {
    int n;
    scanf("%d", &n);

    if (n > 0 && n <= 100) {
    
    
    int num[n][n];
    


    for (int i = 0; i < n; i++) {

        if ( i == 0 ) {
            for (int j = 0; j < n; j++) {
                num[i][j] = num[i][j-1] + j + 1;
                num[0][0] = 1;
            }
        }
        else {
            for (int j = 0; j < n - i; j++) {
                num[i][j] = num[i-1][j+1] - 1;           
            }      
        }
    }

    for (int i = 0; i<n; i++) {
        for (int j = 0; j < n - i; j++) {
            if (num[i][j] != 0) {
            printf("%d ", num[i][j]);
            }      
        }
        printf("\n");
    
    }}


    return 0;
}