打印用排列组合的算法打印杨辉三角

#include <stdio.h>
#include <stdlib.h>
int jix(int x);
int jix1(int x, int y);


int main()
{
int line;
int m, n;
printf("请输入行数：");
while (scanf_s("%d", &line))
if (line > 13)
{
printf("最大支持13行！请重新输入！");
}
else
break;
for (m = 0; m < line; m++)
{
for (n = 0; n < line - m - 1; n++)
{
printf("%3c",' ');
}
for (n = 0; n <= m; n++)
{
printf("%3d%3c", jix1(m ,n) / jix(n),' ');
}
printf("\n");
}
system("pause");
return 0;


}
int jix(int x)
{
int i;
if (x == 0)
return 1;
for (i = x-1; i  > 0; i--)
{
x *= i;
}
return  x;
}


int jix1(int x, int y)
{
int i = y-1;
if (y == 0)
{
return 1;
}
y = x - 1;
if (x == 0)
x = 1;
for (;i > 0;y--,i--)
{
x *= y;
}
return x;
}