Is there any way to find prime number upto 10^9 or more in 1 second?
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3821 |
| 3 | Benq | 3736 |
| 4 | Radewoosh | 3631 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3388 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 10.11.2024 08:11:11 (j3).
Десктопная версия, переключиться на мобильную.
При поддержке
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.me/blog/entry/22317
Thanks a lot for giving link of this blog.