#include<stdio.h>
/*
* 杨辉三角
* 1
* 1 1
* 1 2 1
* 1 3 3 1
* 1 4 6 4 1
* ..........
*/
int main()
{
int q[100][100];
int n;
scanf_s("%d", &n);
int i, j;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= i; j++)
{
if (i == 1 || j == 1 || j == i)
{
q[i][j] = 1;
printf("%d ", q[i][j]);
}
else
{
q[i][j] = q[i - 1][j] + q[i - 1][j - 1];
printf("%d ", q[i][j]);
}
}
printf("\n");
}
return 0;
}
杨辉三角练习
最新推荐文章于 2025-05-19 19:37:25 发布