杨辉三角
#include <iostream>
using namespace std;
void yh(int n);
int main()
{
int n;
cin >> n;
yh(n);
return 0;
}
void yh(int n)
{
int a[50][50];
for (int i=0; i<n; i++)
{
a[i][0] = 1;
a[i][i] = 1;
}
for (int i=2; i<n; i++)
{
for (int j=1; j<n-1; j++)
{
a[i][j] = a[i-1][j-1] + a[i-1][j];
}
}
for (int i=0; i<n; i++)
{
for (int j=0; j<i+1; j++)
{
cout << a[i][j]<<" ";
}
cout << endl<<;
}
cout << endl;
}