Segmented sieve of Eratosthenes can be used to evaluate prime numbers less than n, where n is large enough in pretty less time and memory.
Time complexity: O(n.log(log(n)))
Space complexity: O(sqrt(n))
Link:
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Segmented sieve of Eratosthenes can be used to evaluate prime numbers less than n, where n is large enough in pretty less time and memory.
Time complexity: O(n.log(log(n)))
Space complexity: O(sqrt(n))
Link:
Name |
---|
Auto comment: topic has been updated by matcoder (previous revision, new revision, compare).
If you had posted this 1 day earlier, I could've solved problem C at the NCTU camp :(. (the problem involved looking for minimum prime gaps in a given range, where the left and right bounds can be very big, but their difference is small).
Be it late or not, at least I learned something :).
If n is 1e9, then T.C. would be O( 1e9 * log( log( 1e9) ) ) ?