题解 | #杨辉三角#

#include <stdio.h>
#include <stdlib.h>
int main() {
    int n = 0;
    scanf("%d", &n);
    int arr[n][n];
    for (int i = 0; i < n - 1; i++) {
        for (int j = i + 1; j < n; j++) {
            arr[i][j] = 0;
        }
    }
    for (int i = 0; i < n; i++) {
        arr[i][i] = 1;
        arr[i][0] = 1;
    }
    for (int i = 2; i < n; i++) {
        for (int j = 1; j < n - 1; j++) {
            arr[i][j] = arr[i - 1][j] + arr[i - 1][j - 1];
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (arr[i][j] != 0)
                printf("%5d", arr[i][j]);
        }
        puts("");
    }
    return 0;
}