prime快板子 Factorization Machine

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5, M = 2 * N + 5;

bool vis[N], ans;
void Sieve() {
    memset(vis, true, sizeof(vis));

    vis[0] = vis[1] = false;
    for (int i = 4; i < N; i += 2)
        vis[i] = false;
    for (int i = 3; i < N / i; i += 2) {
        if (!vis[i])continue;
        for (int j = i * i; j < N; j += i + i)
            vis[j] = false;
    }
}
int in[N], vid;
vector<int> primes;

void Gen() {
    for (int i = 2; i < N; ++i)
        if (vis[i])
            primes.emplace_back(i);
}

https://codeforces.com/problemset/problem/1771/C

通俗讲解Factorization Machine - 知乎 (zhihu.com)