2020-06-10 杨辉三角

//
//  main.cpp
//  洛谷
//
//  Created by Jalor on 2020/5/26.
//  Copyright © 2020 Jalor. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <iomanip>
#include <sstream>
#define maxn 55
using namespace std;

int qmi(int m, int k)
{
    int res = 1 , t = m;
    while (k)
    {
        if (k&1) res = res * t;
        t = t * t;
        k >>= 1;
    }
    return res;
}

int read(){
    int x = 0 , f = 1;
    char c = getchar();
    while (c<'0'||c>'9') {
        if (c=='-') {
            f = -1;
        }
        c = getchar();
    }
    while (c>='0'&&c<='9') {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x*f;
}

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