How do I find count of j's such that array[i] & array[j] = array[i] ? Here, '&' is bitwise AND operator.I was thinking of this while solving today's(round 843) problem B. |array| <= 1e5 , max(array) <= 1e18
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 AND operator.I was thinking of this while solving today's(round 843) problem B. |array| <= 1e5 , max(array) <= 1e18
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
plag-reporter | 2023-01-11 06:13:43 | 9 | ||
| en1 |
|
plag-reporter | 2023-01-10 19:58:30 | 253 | Initial revision (published) |
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
