题解 | #蛇形矩阵#

#include <stdio.h>

int main() {
    int n;
    scanf("%d", &n);
    int a[100][100];
    int i, j, count = 1;;
    for (i = 0; i < n; i++) {
        for (j = 0; j <= i; j++) {
            a[i - j][j] = count;
            count++;
        }
    }
    for (i = 0; i < n; i++) {
        for (j = 0; j < n - i; j++) {
            if(j==n-i-1)
                printf("%d", a[i][j]);
            else
                printf("%d ", a[i][j]);
        }
        printf("\n");
    }
    return 0;
}
/*
[i-j,j] 值
0 0 1 i=0
1 0 2 i=1
0 1 3
2 0 4 i=2
1 1 5
0 2 6
3 0 7 i=3
2 1 8
1 2 9
0 3 10
4 0 11 i=4
3 1 12
2 2 13
1 3 14
0 4 15

*/