Is there any way to get all prime numbers tell 1e8??
I am stuck in this problem Printing some primes
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 152 |
9 | maroonrk | 152 |
I am stuck in this problem Printing some primes
Name |
---|
One of the ways I can think is by using a Segmented Sieve which is an extension of the Sieve of Eratosthenes. A segmented sieve works well for large ranges, unlike the Sieve of Eratosthenes. You can check the algorithm on this site: https://www.geeksforgeeks.org/segmented-sieve-print-primes-in-a-range/?ref=lbp
возможно тест Миллера-рабина O(log n)