//计算在整个数组中的项数
int set(int n, int m) {
int sum = 0;
for (int i = 1; i < n; i++)
sum += i;
sum += m;
return sum;
}
//杨辉三角
int main() {
int a[700]= { 1, 1, 1};
int n = 0;
int sum = 1;
cin >> n;
//行数
for (int i = 1; i <= n; i++)
{
//每行中的位置
for (int j = 1; j <= i; j++)
{
if (j == 1 || j == i)
{
a[set(i, j)] = 1;
sum = 1;
}
else
{
a[set(i, j)] = a[set(i - 1, j - 1)] + a[set(i - 1, j)];
sum = a[set(i, j)];
}
cout << sum << ' ';
if (j == i)
cout << endl;
}
}
system("pause");
}
int set(int n, int m) {
int sum = 0;
for (int i = 1; i < n; i++)
sum += i;
sum += m;
return sum;
}
//杨辉三角
int main() {
int a[700]= { 1, 1, 1};
int n = 0;
int sum = 1;
cin >> n;
//行数
for (int i = 1; i <= n; i++)
{
//每行中的位置
for (int j = 1; j <= i; j++)
{
if (j == 1 || j == i)
{
a[set(i, j)] = 1;
sum = 1;
}
else
{
a[set(i, j)] = a[set(i - 1, j - 1)] + a[set(i - 1, j)];
sum = a[set(i, j)];
}
cout << sum << ' ';
if (j == i)
cout << endl;
}
}
system("pause");
}