func_code_string: #include <bits/stdc++.h>   using namespace std;   template <class T>   inline T BMOD(T p, T e, T m) {     T ret = 1;     while (e) {       if (e & 1) ret = (ret * p) % m;       p = (p * p) % m;       e >>= 1;     }     return (T)ret;   }   template <typename T>   inline T POW(T B, T P) {     if (P == 0) return 1;     if (P & 1)       return B * POW(B, P - 1);     else       return SQR(POW(B, P / 2));   }   template <typename T>   inline T ModInv(T b, T m) {     return BMOD(b, m - 2, m);   }   template <typename T>   inline T ABS(T a) {     if (a < 0)       return -a;     else       return a;   }   template <typename T>   inline T gcd(T a, T b) {     if (a < 0) return gcd(-a, b);     if (b < 0) return gcd(a, -b);     return (b == 0) ? a : gcd(b, a % b);   }   template <typename T>   inline T lcm(T a, T b) {     if (a < 0) return lcm(-a, b);     if (b < 0) return lcm(a, -b);     return a * (b / gcd(a, b));   }   int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};   int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};   int n, x, trck[200005], arr[100005];   int main() {     scanf( %d%d , &n, &x);     for (int i = 1; i <= n; i++) {       scanf( %d , &arr[i]);       trck[arr[i]]++;     }     long long int res = 0;     for (int i = 1; i <= 100000; i++) {       int nm = i ^ x;       if (trck[nm] && trck[i]) {         long long int cnt = (long long int)trck[nm] * trck[i];         if (x == 0) cnt = (long long int)trck[nm] * (trck[i] - 1);         res += cnt;       }     }     res /= 2;     printf( %lld , res), puts(  );     return 0;   }   