P5732 【深基5.习7】杨辉三角 洛谷 c++实现

//
// Created by Sween'e'y on 2022/8/8.
//
//P5732 【深基5.习7】杨辉三角

#include <iostream>
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <deque>
#include <array>
#include <set>
#include <map>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <climits>
#include <string>
#include <cstring>


using namespace std;

struct cmp {
    bool operator()(int a, int b) {
          return a > b;
    }
};

template<class T>
int length(T &array) {
      return sizeof(array) / sizeof(array[0]);
}

bool is_prime[100007];

void ai() {
      for (int i = 2; i <= 100000; i++) {
            is_prime[i] = 1;
      }
      for (int i = 2; i <= 100000; i++) {
            if (is_prime[i]) {
                  for (int j = 2 * i; j <= 100000; j += i) {