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
a XOR problem
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. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |