题解 | #杨辉三角#

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