| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
Hello Codeforces community! Hope you all are doing well.
I need some help with the following question that I had while understanding xor basis.
Given an array A. You need to tell how many arrays B of length n exist that satisfy the following property: For each A[i], a subset of B exist such that its xor is equal to A[i] and 0 <= B[i] < 2^k.
Well, you can find the xor basis $$$M$$$ of the given set of vectors $$$A$$$.
If $$$n-|M| \lt 0$$$, then 0 solutions. ( I'll assume this is not possible, because $$$\textbf{n}$$$ that you mention must be the size of array $$$A$$$ )
If $$$n-|M| \gt 0$$$, then there would be infinite solutions really, since you can choose the extra elements freely
I'm not sure how to tackle the case when $$$n-|M| = 0$$$, seems tricky.
Oh, I forgot to mention an important constraint: 0 <= A[i], B[i] < 2^k. Thanks.