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 | 3778 |
2 | Benq | 3592 |
3 | ecnerwala | 3521 |
4 | Um_nik | 3423 |
5 | jiangly | 3375 |
6 | Petr | 3342 |
7 | Radewoosh | 3337 |
8 | scott_wu | 3313 |
9 | maroonrk | 3265 |
10 | yosupo | 3259 |
# | User | Contrib. |
---|---|---|
1 | Errichto | 202 |
2 | 1-gon | 200 |
3 | rng_58 | 194 |
4 | SecondThread | 193 |
5 | awoo | 187 |
6 | vovuh | 183 |
7 | Um_nik | 182 |
8 | antontrygubO_o | 177 |
9 | Ashishgup | 175 |
10 | -is-this-fft- | 171 |
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 .