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) such that , where
is bitwise xoroperation (see notes for explanation).
![](https://i-blog.csdnimg.cn/blog_migrate/3a09289b605bc61c19cf7e8ddd93806c.png)
Immediately, Mehrdad discovered a terrible solution that nobody trusted. Now Arpa needs your help to implement the solution to that problem.
First line contains two integers n and x (1 ≤ n ≤ 105, 0 ≤ x ≤ 105) — the number of elements in the array and the integer x.
Second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 105) — the elements of the array.
Print a single integer: the answer to the problem.
2 3 1 2
1
6 1 5 1 2 3 4 1
2
In the first sample there is only one pair of i = 1 and j = 2. so the answer is 1.
In the second sample the only two pairs are i = 3, j = 4 (since ) and i = 1, j = 5 (since
).
A bitwise xor takes two bit integers of equal length and performs the logical xor operation on each pair of corresponding bits. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1. You can read more about bitwise xor operation here: https://en.wikipedia.org/wiki/Bitwise_operation#XOR.
题意:
给定的 n 个数中,当前第 i 个数和 i 之后的数 j ,满足 i xor j == x 的组数。
思路:
比赛的时候模拟的不够好。
应用 xor(异或)满足 a xor b = c ;b xor c = a 的性质,这个性质怎么会忘记呢!
AC CODE:
#include<stdio.h>
#include<cstring>
#include<algorithm>
#define HardBoy main()
#define ForMyLove return 0;
using namespace std;
const int MYDD = 1103 + 1e7;
/*Bug -> 数组开 1e5 运行出错*/
int a[MYDD];
void Init() {
for(int j = 0; j < MYDD; j++)
a[j] = 0;
}
int HardBoy {
int n, x;
scanf("%d %d", &n, &x);
Init();
__int64 ans = 0;
for(int j = 0; j < n; j++) {
int k;
scanf("%d", &k);
ans += a[x xor k];
a[k]++;
}
printf("%I64d\n", ans);
ForMyLove
}
被覆盖了!