Is there any way to find prime number upto 10^9 or more in 1 second?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | TheScrasse | 145 |
9 | nor | 145 |
Is there any way to find prime number upto 10^9 or more in 1 second?
Название |
---|
Yes. It can be easily using Meisell-Lehmer algorithm to calculate the numbers of prime up to n in O(n^{2/3}).
or you can see F.Four Divisors.
I don't know much about this algorithm. Can you make a tutorial about it please ?
Yeap. Lehmer_algorithm or Efficient Prime Counting with the Meissel-Lehmer Algorithm
Updated blog link ( previous one doesn't work ) :
Efficient prime counting with the Meissel-Lehmer algorithm
If you want to enumerate all the primes upto 10^9 in 1 second, Segment Sieve of Eratosthenes plus Wheel Factorization will help a lot.
An example using primes 2, 3, 5, 7, 11, 13, code
How about using
Bitwise Segment Sieve of Eratosthenes
. Is it better than that ?what about for 10^18?
https://codeforces.com/blog/entry/22317
Thanks a lot for giving link of this blog.