杨辉三角形

点击查看代码

#include<iostream>
using namespace std;
int s[25][25];
int main()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= i; j++)
		{
			if (j == 1||j==i)
			{
				s[i][j] = 1;
				cout << s[i][j] << " ";
			}
			else
			{
				s[i][j] = s[i - 1][j - 1] + s[i - 1][j];
				cout << s[i][j] << " ";
			}
		}
		cout << endl;
	}
	return 0;
}