-
getMinP232's competitive-programming templates. 2024. 8. 3. 15:16
std::vector<int> getMinP(int n) { std::vector<int> primes; std::vector<int> minp(n + 1); for (int i = 2; i <= n; ++i) { if (minp[i] == 0) { minp[i] = i; primes.push_back(i); } for (auto& prime : primes) { if (prime * i > n) { break; } minp[prime * i] = prime; if (i % prime == 0) { break; } } } return minp; }
'232's competitive-programming templates.' 카테고리의 다른 글
PrimePowerCombination (P^E binom) (0) 2024.08.08 extendedEuclid, crt (0) 2024.08.05 LazySegmentTree (0) 2024.08.03 MergeSortTree (0) 2024.08.03 DisjointSparseTable (0) 2024.08.03