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!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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!
Название |
---|