C-杨辉三角

代码:

#include<stdio.h>
int main()
{
    int **p,row,i,j;
	printf("请输入行数:\n");
	scanf("%d",&row);
	p = (int**)malloc(row*sizeof(int*));
	if(p!=NULL){
	for(i=0;i<row;i++)
    {
    p[i] = (int*)malloc(row*sizeof(int));
    for(j=0;j<=i;j++)
    {
    if(j==0||i==j)
    p[i][j]=1;
    else
    p[i][j]=p[i-1][j-1]+p[i-1][j];
    printf("%d ",p[i][j]);
    }
    printf("\n");
    }	
	}
    return 0;
}

图片:

猜你喜欢

转载自blog.csdn.net/Tjhfsghbjknjdy/article/details/85012011