Loading

蓝桥杯基础练习 杨辉三角形

杨辉三角形 http://lx.lanqiao.cn/problem.page?gpid=T10

#include<iostream>
using namespace std;
int main()
{
	int x[34][34] = { 0 };
	for (int i = 0; i < 34; i++)
		x[i][0] = 1;
	for (int i = 1; i < 34; i++)
		for (int j = 1; j <= i; j++)
			x[i][j] = x[i - 1][j - 1] + x[i - 1][j];
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < i + 1; j++)
			cout << x[i][j] << ' ';
		cout << endl;
	}
	return 0;
}
posted @ 2021-01-17 15:56  longwind7  阅读(170)  评论(0)    收藏  举报