The 67th OEIS Problem

    1#include <bits/stdc++.h>
    2using namespace std;
    3using ll = long long;
    4using i128 = __int128;
    5const int inf = 1e9;
    6const ll INF = 1e18; //❄️
    7vector<ll> primes;
    8vector<bool> isprime(300000, 1);
    9void solve() {
    10    int n; cin >> n;
    11    for (int i = 0; i < n; i++) {
    12        if (i == n - 1) {
    13            cout << primes[n - 2] << '\n';
    14            break;
    15        }
    16        if (i > 0) {
    17            cout << primes[i] * primes[i - 1] << " ";
    18        } else {
    19            cout << primes[i] << " ";
    20        }
    21    }
    22}
    23int main() {
    24    ios::sync_with_stdio(0); cin.tie(0); 
    25    int t; cin >> t;
    26    for (int i = 2; i < 300000; i++) {
    27        if (isprime[i]) {
    28            primes.push_back(i);
    29            for (int j = 2 * i; j < 300000; j += i) {
    30                isprime[j] = 0;
    31            }
    32        }
    33    }
    34    while (t--) {
    35        solve();
    36    }
    37    return 0;
    38}