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
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 164 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | SecondThread | 143 |
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
Name |
---|
First break the given xor number like if the number is 11 then break it into 1 + 2 + 8 let's say we store these numbers into a vector arr.
Now if n is less than no. of set bits in the given xor number . Then we need to merge some numbers and it can be done easily.
In other case let's define variable rem = n — no. of set bits in given xor number .
Now if rem is even then we can make all remaining number 1 .
If rem is odd then we find a even number from the arr and add 1 to it . Now fill all the rem no. with 1 this is gonna work (think why ?).
There may be some corner cases when given xor no. is 1 .(Think how can you handle this ) .
Sorry I am very bad at using CF features .