Комментарии
|
0
Thank you. @_@
|
|
0
Thx for your idea.
N non-negative integers are given in binary code. We can use a prefix tree (Trie) to solve case 3. (USACO Training 6.1.3 Cow XOR) O(NlogM) In case 4 we can sort the integers, and the max NOR value must be from two adjacent integers. O(Nlog2M) using quick sort.. |
|
0
No.. Just some problems..
|
|
0
呵呵 哈哈 嘎嘎 嘿嘿 嘻嘻 are all 'Ha Ha'.
|



