| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 6489 | Finding the Kth Prime (Hard) | 2 | 38 |
|
|
| 6488 | Printing some primes (Hard) | 6 | 78 |
|
|
| 6470 | Finding the Kth Prime | 32 | 3392 |
|
|
| 6471 | Printing some primes | 44 | 3353 |
|
#sieve-of-eratosthenes
one of a number of prime number sieves, is a simple, ancient algorithm for finding all prime numbers up to any given limit
https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes http://mathworld.wolfram.com/SieveofEratosthenes.html https://www.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/sieve-of-eratosthenes-prime-adventure-part-4 https://www.youtube.com/watch?v=V08g_lkKj6Q - video presenting a sieve
RSS