MAXIMUM XOR USING K ELEMENT IN ARRAY
for example
5 3
1
2
3
4
5
here no of element=5,k=3; here OUTPUT IS 7 how to approach this type of problm with or without recursion which one is easier source= https://www.spoj.com/problems/CODEIT02/
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | maroonrk | 154 |
5 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 144 |
maximum xor using k element of array
for example
5 3
1
2
3
4
5
here no of element=5,k=3; here OUTPUT IS 7 how to approach this type of problm with or without recursion which one is easier source= https://www.spoj.com/problems/CODEIT02/
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en2 | sridhar153999 | 2019-07-11 16:26:28 | 50 | Tiny change: ' is easier' -> ' is easier\nsource=\nhttps://www.spoj.com/problems/CODEIT02/' | ||
en1 | sridhar153999 | 2019-07-11 16:13:14 | 278 | Initial revision (published) |
Название |
---|