How do I find count of j's such that array[i] | array[j] = array[i] ? Here, '|' is bitwise OR operator.I was thinking of this while solving today's(round 843) problem B. |array| <= 1e5 , max(array) <= 1e18
№ | Пользователь | Рейтинг |
---|---|---|
1 | jiangly | 3846 |
2 | tourist | 3799 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3590 |
6 | Ormlis | 3533 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
9 | Um_nik | 3451 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 161 |
3 | Qingyu | 160 |
4 | Dominater069 | 158 |
5 | atcoder_official | 157 |
6 | adamant | 154 |
7 | Um_nik | 151 |
8 | djm03178 | 150 |
9 | luogu_official | 149 |
10 | awoo | 147 |
Count of submasks of array[i] present in array
How do I find count of j's such that array[i] | array[j] = array[i] ? Here, '|' is bitwise OR operator.I was thinking of this while solving today's(round 843) problem B. |array| <= 1e5 , max(array) <= 1e18
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en2 |
![]() |
plag-reporter | 2023-01-11 06:13:43 | 9 | ||
en1 |
![]() |
plag-reporter | 2023-01-10 19:58:30 | 253 | Initial revision (published) |
Название |
---|