在线等答案,编程,输入n（n为1位正整数），输入n+1层的杨辉三角。有高分！

#include <stdio.h>
#include <stdlib.h>

int Get_Num(int n)/*To get the num of the nodes*/
{
int num=0,i ;
for(i=1;i <=n;i++)
num+=i;
return num;

}
void YHTrigles(int m)
{

int i,j,f=0,k,c=0,num,n=m;
int *a=NULL;
int **b=NULL;
b=(int *)malloc(sizeof(int)*n);/*First should give the original pointer memory！*/
*b=(int *)malloc(sizeof(int)*n);

num=Get_Num(n);
a=(int *)malloc(sizeof(int)*num);

for(i=0;i<n;i++)
for(j=0;j<n;j++)
b[i][j]=0;
for(i=0;i<num;i++)
a[num]=0;/*Initial the arrray！*/
for(i=0;i<n;i++)
for(j=0;j<i+1;j++)
if(j==0||j==i)
b[i][j]=1;
else
b[i][j]=b[i-1][j-1]+b[i-1][j];
for(i=0;i<n;i++)
for(j=0;j<n;j++)
if(b[i][j]!=0)
a[f++]=b[i][j];
/*The program as followed is order to print the number like a tringles!
That m