Arpa’s obvious problem and Mehrdad’s terrible solution codeforces problem/742/ 異或

There are some beautiful girls in Arpa’s land as mentioned before. Once Arpa came up with an obvious problem: Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < j ≤ n) s

>>阅读原文<<