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
# | 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 |
# | 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 |
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
It throws unexpected verdict when an user(Jacksonrr) attempts to hack some submissions of 1702F - Equate Multisets with some test cases.Does this imply author's original solution is wrong?I request the authors(Gol_D,Aris) of this round and MikeMirzayanov to look into this issue.
This guy/girl/trash Satern just participate in contests to cheat and sometimes he/she is successful , sometimes he/she is not . But he/she is so determined(a quality?) that he/she never gives up . So I am requesting MikeMirzayanov to please have a look into his/her submissions and if possible ban him/her as he/she doesn't seem to be in a mood of stopping. Some of his/her sample iconic submissions :- 144239021 , 143689732(in this one even he/she forgot to change the code xd) . Please stop garbage like him/her from reaching high rating asap :( .
Name |
---|