【C语言】杨辉三角

#include               //包含标准库的信息
#define N 10 //N代表数组长度
void show(int a[N][N])
{
    for (int i = 0; i < N; ++i)
    {
        for (int j = 0; j <= i; ++j)
            printf("%6d",a[i][j]);
        putchar('\n');
    }
}

int main(void)                  //每个程序都从main函数的起点开始执行
{
    int a[N][N]={0};
    for (int i = 0; i < N; ++i)
        a[i][0] = 1;
    for (int i = 1; i < N; ++i)
        for (int j = 1; j <= i ; ++j)
            a[i][j] = a[i-1][j-1] + a[i-1][j];
    show(a);
    return 0;
}

输出结果

     1
     1     1
     1     2     1
     1     3     3     1
     1     4     6     4     1
     1     5    10    10     5     1
     1     6    15    20    15     6     1
     1     7    21    35    35    21     7     1
     1     8    28    56    70    56    28     8     1
     1     9    36    84   126   126    84    36     9     1