-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path592-xor-mixup.cpp
More file actions
48 lines (47 loc) · 1.01 KB
/
Copy path592-xor-mixup.cpp
File metadata and controls
48 lines (47 loc) · 1.01 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
/*
* XOR Mixup [1698A]
* Problem: https://codeforces.com/problemset/problem/1698/A
* Verdict: ACCEPTED Solved: 2022-06-28
* Language: C++20 (GCC 11-64)
* Runtime: 15 ms Memory: 0 KB
* Tags: bitmasks, brute force
* Author: BidoTeima
* Source: https://codeforces.com/contest/1698/submission/162060177
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void ACPLS()
{
#ifndef ONLINE_JUDGE
freopen("output.txt", "w", stdout);
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void moo(string fileName){
freopen((fileName+".in").c_str(),"r",stdin);
freopen((fileName+".out").c_str(),"w",stdout);
}
#define tc int tttt;cin>>tttt;while(tttt--)
int main()
{
ACPLS();
tc{
int n;
cin>>n;
int a[n];
int tot=0;
for(auto&i:a)cin>>i,tot^=i;
int ans=-1;
for(int i = 0; i < n; i++){
if(tot^a[i]==a[i]){
ans=a[i];
break;
}
}
cout<<ans<<'\n';
}
}