杨辉三角形

#include <iostream>
#include <cstdio>
using namespace std;
int Factorial( int n){
    if (n ==1 || n == 0 ){
        return 1;
    }else{
        return n * Factorial(n-1);
    }
}
int main(){
    int n;
    while(scanf("%d",&n) != EOF){
        for(int i = 1;i <= n;i ++){//C(i,j) i从1开始 j从0到i
            for (int j = 0;j <= i; j++){
                int num = Factorial(i)/(Factorial(j)*Factorial(i-j));//杨辉三角形等于二项式定理系数
                printf("%d ",num);
            }
            printf("\n");
        }
    }
    return 0;
}

#include <iostream>
#include <cstdio>
using namespace std;

int main(){
    int n;
    while(scanf("%d",&n) != EOF){
        int yh[n+1][n+1];
        for(int i = 1;i <= n ; i ++){
            for(int j = 1;j <= i; j ++){
                if(j == 1 || j == i){
                    yh[i][j] = 1;
                }else{
                    if (i == 2 && j == 2){
                        yh[i][j] = 2;
                    }
                    if(i > 2){
                        yh[i][j] = yh[i-1][j-1] + yh[i-1][j];//1 2 1
                                                             //1 3 3 1 中间俩为上排俩元素的和
                    }
                }
            }
        }
        for(int i = 1;i <=n;i ++){
            for(int j = 1;j <= i; j ++){
                printf("%d ",yh[i][j]);
            }
            printf("\n");
        }
    }

    return 0;
}