Link of the problem is https://www.spoj.com/problems/PRIMES2 .
Which algorithm should be used to solve this problem? And how wheelSieve + segmentedSieve is implemented?
Thank you in advance.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 170 |
| 2 | Um_nik | 162 |
| 3 | atcoder_official | 161 |
| 4 | maomao90 | 160 |
| 5 | djm03178 | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | Dominater069 | 156 |
| 8 | adamant | 154 |
| 9 | luogu_official | 153 |
| 10 | awoo | 152 |
→ Find user
→ Recent actions
How to generate prime numbers up to 10^9 in 2.2 seconds?
Revision en2, by TUDORTEA, 2020-09-22 21:20:31
History
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/29/2024 07:05:18 (k2).
Desktop version, switch to mobile version.
Supported by
