#include "stdio.h"
#define M 10
#define N 10
int main(int argc, char const *argv[])
{
int su[M][N];
for (int i = 0; i < M; i++)
{
for (int j = 0; j < N; j++)
{
su[i][j] = 1;
}
}
for (int i = 1; i < M; i++)//注意,从1开始
{
for (int j = 1; j < i; j++)//1开始
{
su[i][j]=su[i-1][j]+su[i-1][j-1];//杨辉三角的规律
}
}
//输出
for (int i = 0; i < M; i++)
{
for (int j = 0; j <= i; j++)
{
printf("%4d",su[i][j]);//4d更好看,直观
}
printf("\n");
}
return 0;
}
打印杨辉三角前10行
最新推荐文章于 2024-06-27 17:17:34 发布
![](https://img-home.csdnimg.cn/images/20240611030827.png)