题目:
1
1 1
1 2 1
1 3 3 1
#include<iostream>
#define aLen 7
using namespace std;
int main()
{
int a[aLen][aLen];
a[0][0] = 1;
a[1][0] = 1;
a[1][1] = 1;
for(int i = 2;i < aLen;i++)
{
for(int j = 0;j <= i;j++)
{
if((0 == j)||(i == j))
{
a[i][j] = 1;
}
else
{
a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
}
}
}
for(int a_i = 0;a_i < aLen;a_i++)
{
for(int a_j = 0;a_j <= a_i;a_j++)
{
printf("%d",a[a_i][a_j]);
}
printf("\n");
}
return 0;
}
输出:
1
11
121
1331
14641
15101051
1615201561
Press any key to continue