#include using namespace std;

int main() { int n; cout << "请输入一个小于20的整数n:"; cin >> n; int a[20][20] = {0}; //定义二维数组存储杨辉三角 for (int i = 0; i < n; i++) { a[i][0] = a[i][i] = 1; //每行首尾元素为1 for (int j = 1; j < i; 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; j++) { cout << a[i][j] << " "; } cout << endl; } return 0;


原文地址: https://www.cveoy.top/t/topic/fqvx 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录