Given the xor of n numbers,I need to find those n numbers (all positive) such that their sum is minimum. I thought on the lines of minimising the bitwise and of the n numbers, but couldn't come up with a solution. Thanks in advance
Help needed in a problem
Given the xor of n numbers,I need to find those n numbers (all positive) such that their sum is minimum. I thought on the lines of minimising the bitwise and of the n numbers, but couldn't come up with a solution. Thanks in advance
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | __Apocalypse__ | 2019-09-11 22:03:06 | 255 | Initial revision (published) |