you will be given an array. and q query.
In every query you will be given a k. how many subarray xor less than k?
** I think it can be solved with persistent trie. but i need another solution.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 4 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 135 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
Xor subarray less than k in every query
you will be given an array. and q query.
In every query you will be given a k. how many subarray xor less than k?
** I think it can be solved with persistent trie. but i need another solution.
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en4 |
|
YoyOyoYOy000y000 | 2020-02-02 17:04:06 | 6 | Tiny change: 'be solved with persisten' -> 'be solved by persisten' | |
| en3 |
|
YoyOyoYOy000y000 | 2020-02-02 10:53:45 | 31 | Tiny change: 'q query.\n\nIn ev' -> 'q query.\nq and n all less than 100000.\n\nIn ev' | |
| en2 |
|
YoyOyoYOy000y000 | 2020-02-02 10:52:34 | 4 | Tiny change: 'han k?\n\n## I think i' -> 'han k?\n\n** I think i' | |
| en1 |
|
YoyOyoYOy000y000 | 2020-02-02 10:52:08 | 240 | Initial revision (published) |
| Название |
|---|


