题解 | #杨辉三角#

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

}