//前几次都是PE,改了两处之后过了,如果也是PE的话可以参考一下
//第一处是注意到最后一个1后无空格
//第二处是每一个三角后加一个空行
AC代码:
#include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
int t,n;
long long y[20][20];
cin >> t;
y[0][0] = 1;
y[1][0] = 1;
y[1][1] = 1;
y[2][0] = 1;
y[2][1] = 2;
y[2][2] = 1;
y[3][1] = 3;
y[3][2] = 3;
for (int i = 2; i <= 19; i++)
{
for (int j = 0; j <i; j++)
{
y[i][i] = 1;
y[i][0] = 1;
y[i][j] = y[i - 1][j - 1] + y[i - 1][j];
}
}
cin >> n;
while (t--)
{
for (int i= 0; i < n; i++)
{
for (int j = 0; j <=i; j++)
{if(j!=i)cout << y[i][j] << " ";
else cout << "1";
}
cout << endl;
}
cin >> n; cout << endl;
}
//system("pause");
return 0;
}
还记得中学时候学过的杨辉三角吗?
基本的特征是: