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 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | jiangly | 3578 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | tourist | 3565 |
8 | maroonrk | 3531 |
9 | Radewoosh | 3521 |
10 | Um_nik | 3482 |
# | 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 |
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!
I've come across this probability problem and could not solve it. In order to learn, I searched for the solution on the internet and found out that people just printed 1/2
. i.e., the answer, no matter the value of n
, is always 50%.
Why is that so? I tried making some DP for testing values under ~20 and only when n = 2 the answer is indeed 1/2
.
Can someone give me some help on this tough (for me) one?
Appreciate the help!
Name |
---|