下边是数字三角形的代码,题目自己找吧
// thomas lee
#include <iostream>
#define N 20
using namespace std;
// a[i][j] = a[i-1][j-1] + a[i-1][j]
// when j==0 or j==i, a[i][j]==1
int main()
{
int a[N][N];
for(int i = 0; i < N; i++)
{
for(int j=0; j < i; j++)
{
if(j==0 || j== i) a[i][j] = 1;
else{
a[i][j] = a[i-1][j-1] + a[i-1][j];
}
cout<<a[i][j]<<" ";
}
cout<<endl;
}
return 0;
}