So I've got a question about problems that need prime numbers. How are you meant to approach them? More specifically, how do you approach problems that require you to calculate prime numbers and do something with them? Do you implement/copy paste something like the sieve of Eratosthenes every time or is there a better method? Thanks in advance.
→ Pay attention
→ Streams
→ Top rated
| # | 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 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/25/2024 11:54:41 (f1).
Desktop version, switch to mobile version.
Supported by
Your question sounds ambiguous to me so I cannot really fully answer it. The most important thing is, there is no rule to solve all problems. Prime numbers might occur in different ways and each problem will be different from other. That's why you should solve more problems to understand how primes might come in handy.
While solving problems, you will learn how to solve specific problems e.g. prime factorization in $$$O(logn)$$$ or check primality in more efficient way. If you want to learn more about primes (or number theory as a whole) then I suggest you to read this.