For this Question: Given an array of positive element having size N and an integer C. Check if there exists a pair (A,B) such that A xor B = C.First line of input contains number of testcases T.
The First line of each testcase contains two integers N and C.
The 2nd line of each testcase, contains N space separated integers denoting the elements of the array A.

Constraints:
1 <= T <= 50
1 <= N <= 10000
1 <= C <= 10000
0 <= arr[i] <= 10000Print "Yes" is the pair exists else print "No" without quotes.(Change line after every answer).Input:
2
7 7
2 1 10 3 4 9 5 
5 1
9 9 10 10 3 

Output:
Yes
No

Explanation :
In first case, pair (2,5) give 7. Hence answer is "Yes". In second case no pair exist such that satisfies the condition hance the answer is "No"., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;

#define pu push_back
#define fi first
#define se second
#define mp make_pair
#define int long long
#define pii pair<int,int>
#define mm (s+e)/2
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(int i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define sz 200000

signed main()
{
	
		int t;
		cin>>t;
		while(t>0)
		{
			t--;
			int n,C;
			cin>>n>>C;
			set<int> ss;
			int ch=0;
			for(int i=0;i<n;i++)
			{
                int a;
                cin>>a;
                int p=a^C;
                if(ss.find(p)!=ss.end()) ch=1;

                ss.insert(a);
			}
			if(ch==1) cout<<"Yes"<<endl;
			else cout<<"No"<<endl;


		}
	
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?