题解 | 杨辉三角

#include <stdio.h>

int main(int argc, char const *argv[])
{
    int a[30][30] = {0}, n = 0, i = 0, j = 0;
    scanf("%d", &n);
    // 第一列全部为1
    for (; i < n; i++)
    {
        a[i][0] = 1;
        printf("%5d", a[i][0]);
        for (j = 1; j <= i; j++)
        {
            a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
            printf("%5d", a[i][j]);
        }
        putchar('\n');
    }
    return 0;
}