可以求随机行数的杨辉三角
#include <stdio.h>
int main()
{
int n = 0;
scanf("%d", &n);
int arr[100][100] = { 0 };
int i = 0;
for (i = 0; i < n; i++)
{
int j = 0;
for (j = 0; j < n; j++)
{
if (i == j || j == 0)
{
arr[i][j] = 1;
}
else {
arr[i][j] = arr[i - 1][j] + arr[i - 1][j - 1];
}
}
}
int j = 0;
for (i = 0; i < n; i++)
{
for (j = 0; j < n - 1 - i; j++)
{
printf(" ");
}
for (j = 0; j <= i; j++) {
printf("%3d ", arr[i][j]);
}
printf("\n");
}
return 0;
}