杨辉三角

题目链接

http://acm.nefu.edu.cn/problemShow.php?problem_id=441

 

 

 1 #include <bits/stdc++.h>
using namespace std;
int a[100][100];
int main()
{
    int n;
    while (cin >> n && n > 0)
    {

        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= i; j++)
            {
                if (j == 1 || j == i)
                    a[i][j] = 1;
                else
                {
                    a[i][j] = a[i - 1][j] + a[i-1][j -1];
                    
                }
                if(j!=i)
                printf("%d ", a[i][j]);
                else
                {
                    printf("%d",a[i][j]);
                }
                
            }
            printf("\n");
        }
      printf("\n");
    }
    return 0;
}