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
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
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
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |
Name |
---|