Prime count in large range

Правка en1, от tbquan08hanoi, 2024-09-05 17:35:12

Hello codeforces!

I have a problem: counting primes in $$$[m, n)$$$ where $$$1<=m<n<=2 \cdot 10^9$$$.

Because the range could be large, I can't use sieve because of the memory complexity or normal primality test in $$$O(sqrt(n))$$$

Thanks very much!

Теги primality test, primes, prime

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский tbquan08hanoi 2024-09-05 17:35:12 272 Initial revision (published)