Please subscribe to the official Codeforces channel in Telegram via the link ×

XOR Maximization

Revision en5, by taxicoo, 2015-09-04 23:17:53

We have a task, solution can be found here

Let's change a bit out task:

  1. We need to select exactly 1<=K<=N numbers (caustique asked about it here but nobody replied)

  2. We need to select not more then 1<=K<=N numbers

I will be grateful for all ideas

Upd: don't look at constaints

Tags xor


  Rev. Lang. By When Δ Comment
ru4 Russian taxicoo 2015-09-04 23:18:11 35 Мелкая правка: 'ражениям\n' -> 'ражениям\n\nUpd: не смотрите на ограничения\n'
en5 English taxicoo 2015-09-04 23:17:53 31 Tiny change: 'll ideas\n' -> 'll ideas\n\nUpd: don't look at constaints'
ru3 Russian taxicoo 2015-09-04 22:37:27 25 Мелкая правка: 'entry/1201) но никто' -> 'entry/1201?locale=ru#comment-149109) но никто'
en4 English taxicoo 2015-09-04 22:36:27 25 Tiny change: 'entry/1201) but nobo' -> 'entry/1201?locale=ru#comment-149109) but nobo'
en3 English taxicoo 2015-09-04 21:59:22 0 (published)
ru2 Russian taxicoo 2015-09-04 21:57:11 364
en2 English taxicoo 2015-09-04 21:52:59 6 Tiny change: '04] asked for it [here]' -> '04] asked about it [here]'
ru1 Russian taxicoo 2015-09-04 21:51:50 417 Первая редакция перевода на Русский
en1 English taxicoo 2015-09-04 21:50:28 417 Initial revision (saved to drafts)