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

Please, try EDU on Codeforces! New educational section with videos, subtitles, texts, and problems.
×

# | User | Rating |
---|---|---|

1 | MiFaFaOvO | 3681 |

2 | tourist | 3669 |

3 | Um_nik | 3535 |

4 | 300iq | 3317 |

5 | ecnerwala | 3294 |

6 | maroonrk | 3268 |

7 | TLE | 3223 |

8 | scott_wu | 3209 |

9 | WZYYN | 3180 |

10 | boboniu | 3174 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 197 |

2 | antontrygubO_o | 188 |

3 | pikmike | 183 |

4 | Ashishgup | 182 |

5 | vovuh | 179 |

6 | Radewoosh | 168 |

7 | Um_nik | 164 |

8 | tourist | 163 |

8 | Monogon | 163 |

10 | McDic | 162 |

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

↑

↓

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/07/2020 00:08:55 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

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 .