diff options
| author | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 01:24:14 +0100 |
|---|---|---|
| committer | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 01:24:14 +0100 |
| commit | 98567ec798aa8ca2cfbcb85c774dd470f30e30d4 (patch) | |
| tree | 5113d5cc24d1ad5f93810b6442ce584a36950dc8 /math/primeSieve.cpp | |
| parent | ad3856a6b766087df0036de0b556f4700a6498c9 (diff) | |
| parent | 8d11c6c8213f46f0fa19826917c255edd5d43cb1 (diff) | |
mzuenni tests
Diffstat (limited to 'math/primeSieve.cpp')
| -rw-r--r-- | math/primeSieve.cpp | 16 |
1 files changed, 0 insertions, 16 deletions
diff --git a/math/primeSieve.cpp b/math/primeSieve.cpp deleted file mode 100644 index 1b0f514..0000000 --- a/math/primeSieve.cpp +++ /dev/null @@ -1,16 +0,0 @@ -constexpr ll N = 100'000'000; -bitset<N / 2> isNotPrime; -vector<ll> primes = {2}; - -bool isPrime(ll x) { - if (x < 2 || x % 2 == 0) return x == 2; - else return !isNotPrime[x / 2]; -} - -void primeSieve() { - for (ll i = 3; i < N; i += 2) {// i * i < N reicht für isPrime - if (!isNotPrime[i / 2]) { - primes.push_back(i); // optional - for (ll j = i * i; j < N; j+= 2 * i) { - isNotPrime[j / 2] = 1; -}}}} |