#include <stdio.h>
#include <windows.h>
//杨辉三角的每个数等于多项式的系数:C(n,m)
//C(n,m)=n!/(m!*(n-m)!)
int factorial(int num)//阶乘
{
int tmp = 1;
if (num==0)
return tmp;
else
{
int i = 0;
for (i = num; i >0; i--)
tmp *= i;
return tmp;
}
}
int C_n_m(int n,int m)//系数C(n,m)
{
int num = 0;
num = factorial(n) / (factorial(m)*factorial(n - m));
return num;
}
int main()
{
int i = 0;
int j = 0;
int number = 0;
scanf("%d",&number);
for (i = 0; i < number; i++)
{
for (j = 0; j <= i; j++)
printf("%d ", C_n_m(i, j));
printf("\n");
}
system("pause");
return 0;
}