Codeforces Round ＃803 (Div. 2)

A - XOR Mixup

A - XOR Mixup

The main idea of the topic ：

To one with n Array of Numbers , Among them is 1 The number is another n-1 XOR sum of numbers , Find this number .

practice ：

Because there must be a solution , So the XOR sum of the whole array is 0, Just choose one at will .

#include<bits/stdc++.h> 
using namespace std;
typedef long long ll;
const int N=2e5+10;
int T,n;
void slove(){
    
	int n;
	cin>>n;
	int ans;
	for(int i=0;i<n;i++){
    
		cin>>ans;
	}
	cout<<ans<<endl;
}
int main(){
    
	cin>>T;while(T--)
	slove();
	return 0;
} 

B - Rising Sand

B - Rising Sand