杨辉三角
#include <iostream>
#include <vector>
#include <iomanip>
int main() {
int n;
cin >> n;
vectorvector<int>> triangle(n, vector<int>(n, 0));
for (int i = 0; i < n; i++) {
triangle[i][0] = 1;
triangle[i][i] = 1;
for (int j = 1; j < i; j++) {
triangle[i][j] = triangle[i - 1][j - 1] + triangle[i - 1][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
cout <<setw(5) << triangle[i][j];
}
cout << endl;
}
return 0;
}