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
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 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 148 |
9 | pajenegod | 145 |
9 | orz | 145 |
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 .