Hi!
I've come across this piece of code of a (modified?) sieve and I'm trying to figure out what sieve[i]
means and how it works, specially the 2nd for.
Would you help me, please?
Thanks!
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Name |
---|
sieve[i]
gives you the index of the biggest prime factor. The index is one-based.sieve[20] == 3
, because20 = 2*2*5
andprimes[3] == 5
(5
is the third prime number)Using this method, you generate the prime factorization pretty quick. You can find the biggest prime number using the
sieve
, divide by this number and repeat with the result.I think you meant
prime[5] = 3
, right?No,
primes
is a list of primes.primes = { 0, 2, 3, 5, 7, 11, ... }
Ah, sorry I totally misunderstood.
I thought you meant to give another example, which is
sieve[5] = 3
, and didn't notice the difference in arrays' names. Sorry about that :D