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 | 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 |
# | User | Contrib. |
---|---|---|
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 |
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 |
---|