Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

bassuniz's blog

Xor problem
By bassuniz, history, 12 months ago, In English

Yesterday, I was curious about this problem Given an array

$$$ a = [a_1, a_2, \dots, a_n] $$$

Construct another array

$$$ b = [b_1, b_2, \dots, b_n] $$$

such that the value

$$$ (a_1 \oplus b_1) \oplus (a_2 \oplus b_2) \oplus \dots \oplus (a_n \oplus b_n) $$$

is maximized.

  • Vote: I like it
  • -18
  • Vote: I do not like it

Comments Comments (0)
| Write comment?