[Solution] XOR Mixup Codeforces Solution

[Solution] XOR Mixup Codeforces Solution

A. XOR Mixup

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There is an array a$a$ with n−1$n-1$ integers. Let x$x$ be the bitwise XOR of all elements of the array. The number x$x$ is added to the end of the array a$a$ (now it has length n$n$), and then the elements are shuffled.

You are given the newly formed array a$a$. What is x$x$? If there are multiple possible values of x$x$, you can output any of them.

Input

The input consists of multiple test cases. The first line contains an integer t$t$ (1≤t≤1000$1\le t\le 1000$) — the number of test cases. The description of the test cases follows.

The first line of each test case contains an integer n$n$ (2≤n≤100$2\le n\le 100$) — the number of integers in the resulting array a$a$.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

The second line of each test case contains n$n$ integers a1,a2,…,an$a_1,a_2,\dots ,a_n$ (0≤ai≤127$0\le a_i\le 127$) — the elements of the newly formed array a$a$.

Additional constraint on the input: the array a$a$ is made by the process described in the statement; that is, some value of x$x$ exists.

Output

XOR Mixup Codeforces Solution

Rising Sand Codeforces Solution

3SUM Closure Codeforces Solution

Fixed Point Guessing Codeforces Solution

PermutationForces II Codeforces Solution

Equal Reversal Codeforces Solution

Long Binary String Codeforces Solution

For each test case, output a single integer — the value of x$x$, as described in the statement. If there are multiple possible values of x$x$, output any of them.