题解 | #杨辉三角#

#include <stdio.h>
#include<string.h>
//定义阶乘函数
long long jiecheng(int x)
{
    int i = 1;
    long long sum = 1;
    for (i = 1;i <= x;i++)
    {
        sum *= i;
    }
    return sum;
}
//定义组合公式
long long f(int x, int y)
{
    long long ret = jiecheng(y) / (jiecheng(x) * jiecheng(y - x));
    return ret;

}
int main()
{
    int n = 0;
    scanf("%d", &n);
    int i = 0;
    int j = 0;
    int k = 0;
    for (i = 1;i <= n;i++)
    {
        for (k = 0;k < i;k++)
        {
            printf("%5lld", f(k, i-1));
        }
        putchar('\n');
    }
    return 0;
}