Пожалуйста, подпишитесь на официальный канал Codeforces в Telegram по ссылке https://t.me/codeforces_official. ×

a XOR problem

Правка en2, от i.trofimow, 2016-12-26 00:38:08

Given 2 mutisets A and B, |A| = |B|, |A|, |B| <= 10^5, 0 <= elements in set <= 10^18. The task is to find such X that A ^ X = B or say that such X doesnt exists. How can one do that? A ^ X means foreach element of A xor it with X

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский i.trofimow 2016-12-26 00:38:08 47 Tiny change: 'e do that?' -> 'e do that? A ^ X means foreach element of A xor it with X'
en1 Английский i.trofimow 2016-12-26 00:37:05 196 Initial revision (published)