题解 | #杨辉三角#
杨辉三角
https://www.nowcoder.com/practice/e671c6a913d448318a49be87850adbcc
#include <stdio.h>
int main() {
int n;
int i,j;
scanf("%d",&n);
int tri[100][100]={0};
tri[0][0]=1;
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
{
tri[i][j]=tri[i-1][j-1]+tri[i-1][j];
printf("%5d",tri[i][j]);
}
printf("\n");
}
return 0;
}
